Q6: List all possible valid paths e-g =2,gd=4,dc=7,ce=8,ed=5,gc=3 1. What is maximum cost path 2. What is minimum cost path Q7: solve the flowing recurrence using the master theorem. T(n)=4T(3n)+nlog34 Q8: prove how merge-sort will sort the list E, X, A, M, P, L, E