Q2 (16 points total: 4 points each, partial points for partially correct) Determine the running time for recursive functions. These are multiple choice questions. Note that T(1)=(1). Please enter your choices to the D2L: 8. Q2(3). If T(n)=2T(2n])+n, then T(n) belongs to a) O(nlog2n) b) O(n) c) (nlog2n) d) (n) e) (n2) 9. Q2(4). If T(n)=16T(4n)+n2, then T(n) belongs to a) O(nlog2n) b) O(n) c) (nlog2n) d) (n) e) (n2)