2. (20 total points) Felix the cow ate all of your homework and turned it into cud! However, you were able to recover tattered parchments containing only the following information below. F= m (2, 6, 10, 14, 18, 19, 25, 26, 27, 28, 29, 30, 31) OXX10 XOX10 XX010 XX110 XIX10 1x0iX 1XX10 11XIX 111XX (a) (10 points) Show the additional reduction steps of the QMCF method in order to finish reducing the function Felix was working on. Only circle the prime implicants necessary for minimization. Show all steps for full credit, BUT don't do a Petrick table! (b) (10 points) Based on your answer from (a), build a Petrick reduction table to reduce the Boolean function to an expression of implicant sum of products (SOPs) which would be used to implement a minimum function. You must demonstrate the appropriate method by showing all your work for full credit. Be sure to show the final reduced and minimized Boolean expression which results from the QMCF process. Call it F for Felix or Fred for F reduced! Page 1 of 3 2. (20 total points) Felix the cow ate all of your homework and turned it into cud! However, you were able to recover tattered parchments containing only the following information below. F= m (2, 6, 10, 14, 18, 19, 25, 26, 27, 28, 29, 30, 31) OXX10 XOX10 XX010 XX110 XIX10 1x0iX 1XX10 11XIX 111XX (a) (10 points) Show the additional reduction steps of the QMCF method in order to finish reducing the function Felix was working on. Only circle the prime implicants necessary for minimization. Show all steps for full credit, BUT don't do a Petrick table! (b) (10 points) Based on your answer from (a), build a Petrick reduction table to reduce the Boolean function to an expression of implicant sum of products (SOPs) which would be used to implement a minimum function. You must demonstrate the appropriate method by showing all your work for full credit. Be sure to show the final reduced and minimized Boolean expression which results from the QMCF process. Call it F for Felix or Fred for F reduced! Page 1 of 3