2 (10 points) Please perform min cost technology mapping for Boolean function: y = (cod) (k.(a+b)+k. b.c)-(a+b) + ((cod) @(k.(a+b)+k. b.c))-de Please use the cell library on page 24 of Lecture 10 plus a NOR2 gate with cost of 3.Certainly! Let's break down the mapping of the given Boolean function step by step using the provided cell library, which includes NOR2 gates with a cost of 3 for OR. AND, and XOR operations. The given Boolean function is: y: (cad}$[k~(a+b)+kbc] - [o+b)+[(cod}$(k-(o+b)+kbc))doe Here are the detailed steps for mapping this function: 1. Map c o d: ' Use a 2-input AND gate for c: o d. 2. Map a; l or. ' Use a 2-input OR gate for a l b. 3. Map be: ' Use a 2-input AND gate for be. 4. Map a; + b + be: ' Use two 2-input OR gates: ' The first OR gate combines a and b. " The second OR gate combines the output of the first OR gate with be. 5. Mapk-(alblbc]: ' Use a 3-input OR gate to combine 3:, o + b, and be. 6. Map xon (c - (1)63 (k. (a + b + be\": ' Use two 2-input XOR gates: " The first XOR gate takes inputs :3 o d and the output from step 5. ' The second XOR gate takes inputs from the first XOR gate and d - e. 7". Map the final AND gate for the entire function: ' Use a 3-input AND gate to combine the output from step 5 with d and e. 8. Map OR operations: ' If there are additional OR operations in your function. use 2-input NOR2 gates (considering the cost of 3) to implement each OR operation. By following these steps and using the NOR2 gates from the provided cell library, you can map the given Boolean function efficiently. Remember that the specific implementation details might vary based on the exact characteristics of the cell library provided in your lecture materials