Consider the following Karnaugh diagram for the Boolean function fe F(3) T 12 T 1X2 I122 X1X2 13 1 23 1 (a) What is the minimal polynomial m for the Boolean function f? e = 22 (x1+23) (imti + x3) is equivalent to the minimal polynomial m (b) Show that the Boolean term from part (a). (c) Compare the costs (number of variables in the term; doubles included) of m and e. Does the minimal polynomial really have the lowest costs? If not, why is this possible