Any help with this would be great. We are using multimedia logic to build our circuits.

| |Normal! 1 No Spac Heading 1 Heading 2 Title Subtitle Subtle Em Emphasis Intense E., Strong Styles Complete each of the below problems and upload to D2L by 11:59PM on the due date. To get full credit, you must explain your answer-do not just provide the answer (e.g., a number) without context. For logic design problems, upload the corresponding Multimedia Logic file. The uploaded file should be a single ZIP file that contains the composite file set. 1. What is the equivalent, simplified Boolean expression of the below circuit in both Sum of Products (SOP) and Product of Sums (POS) form? Components are NAND, NOR, and XOR. 2. Given the Boolean function in soP form: f(A,B, C, D)- ACD+ ABCD +ABC+ ABC Simplify the function as much as possible (show your work) a) b) Design and test the corresponding logic circuit c) Show the equivalent, simplified POS expression Design and test a simplified logic circuit that emulates a multiplexer with two (2) input lines, one (1) selector line, and one (1) output. Do not use a multiplexer itself-just design the equivalent using other Boolean gates. 3. 4. Design and test a "sorter" circuit that has two (2) inputs and two (2) outputs. It acts as follows: F1 F2 Sorter Circuit 0 0 F2 5. Design and test a simplified logic circuit to identify all numbers in the Fibonacci sequence beteen 0 and 15. This circuit should have four (4) inputs [to represent the number in binary] and one (1) output [0 not Fibonacci, 1-is Fibonacci]. An explanation of the Fibonacci sequence can be found here: http://en.wikipedia.org/wiki/Fibonacci number