t Question 4 0 12.5 pts Provide a numerical answer Consider the following recurrence relation: If n = 1 2T(n/2) cn if >1. Let c be 3. If we expand T(2), then T(2) Provide a numerical answer Consider the following recurrence relation If n T(n) 2T(n/2) cn ifn 1. Let c be 3. If we expand T(4). then T(4) Question 5 0/ 12.5 pts Provide a numerical answer. Consider the following recurrence relation: n)-) 2T(n/2) + cn if n1 if n > 1 , Using the recurrence tree method, we found that T(n)- c.n.logn) (log base 2) None of these answers O n.logln) (log base 2) n.log(n) (log base 2). You selected this answer c.logn) (log base 2) c.n Question 2 0 12.5 pt Provide a numerical answer Consider the following recurrence relation: ,T(n)=) if n1 2T(n/2) + cn if n > 1 When developing the recurrence tree, the 4th level ("4th call) has nodes