Please help me with part A & D only. Since part D is very small, I hope you would be kind enough to help me with both parts. Thanks in advance.

Question 2 (Digital Circuits and Number Representation). [30%) Your task is to design a circuit which compares two 2-bit unsigned binary numbers. The circuit has four inputs: A, B represent the higher-order and lower-order bits, respectively, of number N and C, D represent the higher-order and lower-order bits, respectively, of number N2. The circuit should have three outputs. F1-F2 and F3. F1 is asserted true when Ni = N2. F2 s asserted true when Ni N2 a) Draw a truth table for the outputs F1, F2, F3 in terms of the inputs A, B,C, D. [10 marks] b) Give a sum-of-products (disjunction of conjunctions) expression for each of the outputs F1, F2, F3, based on the truth table you have drawn. 3 marks] c) Using the laws of Boolean algebra try to come up with a minimized sum-of-products expression for your three answers answers to part b). [6 marks d) Assume that 7's complement is just like 2's complement, but with base 7 and the appropriate digits. What are the smallest and largest 7's complement numbers that can be represented with n digits? Write your answer as a function of n. [6 marks