Induction proof on recurrence

[1SJ Consider the following recurrence relation defined only forn-2 for intcegers k 1: T(2) = 5, and for n 4, T(n) = 2n + T(n/2). Three students were working together in a study group and came up with three dif ferent answers for this recurrence: (a) T(n)-2 n log2(n) 3 (b) T(n)-og2(nn1 (c) T(n)-4n 3 Determine which solution (if any) is correct by trying to prove that each one is cor rect by induction. If you cannot complete the induction proof, explain what goes wrong