Question One: Suppose T(n)=3/2T(n/2]n a) Prove that T(n)=O(n) by mathematical induction (substitution). b) Prove that T(n)=O(n) by recursive method (expansion). Question Two: Merge(L1, L2), below, is a function which merges two sorted linked lists L1 and L2, and outputs a single sorted linked list. By "sorted", we mean increasing order. Merge(L1, L2) If L1 is empty, then return L2; If L2 is empty, then return L1; x = the first element of L1; y = the first element of L2; If x