Question 6 (4 points) A logic circuit realizing the function F has four inputs A, B, C and D. The inputs A and B represent a two-bit number N1 and the inputs C and D represents another two-bit number N2, with A and C being the most-significant bit in each one of the digits. The function F will be "1" if the sum of the digits N1 N2 is a prime number. For instance, if ABCD "0110", then F will be "1" because it corresponds to the sum of AB 01 (N1-1)10 and CD-10 (N2-2)1o so the sum is 3, which is a prime number (A number is prime if it divisible only by itself and 1; 2 is prime but O and 1 are not) What is the Maxterm expression for F(A,B,C,D)? 1) F(A,B,C,D)-??(0,2,4,7,10,13,15) 2) F(A,B,C,D)-??2,3,5,6,8,9,11,12,14) 3) F(A,B,C,D) m(0,1,4,7,10,13,15) 4) Both options 1) and 3) 5) None of the above