Using K-map, simplify each of the following Boolean functions as follows: 1. Draw a K-map for the function. 2. Find all prime implicants (PI’s). Mark on the K-map and write the Boolean expression of the PI. 3. Indicate essential PI’s. 4. Find the simplified expression (if more than one optimum solution is found, list all of them). Q1. F(a, b, c, d) = m(3,4,5,7,9,13,14,15) Q2. F(a, b, c, d) = m(0,2,4,6,7,8,9,12,13,15) Q3. F(a, b, c, d) = m(0,2,4,5,6,7,8,10,13,15) Q4. F(a, b, c, d) = m(0,2,3,5,7,8,10,11,14,15)

Python. primary u. s. interstate highways are numbered 1-99. odd numbers (like the 5 or 95) go north/south, and evens (like the 10 or 90) go east/west. auxiliary highways are numbered 100-999, and service the primary highway indicated by the rightmost two digits. thus, the 405 services the 5, and the 290 services the 90. given a highway number, indicate whether it is a primary or auxiliary highway. if auxiliary, indicate what primary highway it serves. also indicate if the (primary) highway runs north/south or east/west.