Question 2 (6 points) Let g : {0, 1}" > {0, 1}, h : {0, 1}" > {0, 1} be functions. Define f : {0, 1}" x {0, 1}" > {0, 1} as Construct a deterministic (no randomness) 1-perfectly-secure two-party MPC protocol that enables Alice, with input r, and Bob, with input y, to compute f(r, y). In particular, describe your protocol and show how to (perfectly) simulate the view each of Alice and Bob. Briefly justify correctness and security