Q1. Find the topological sorting problem for the given graph A and B. (2 Mark) Q2. Apply Merge sort and Quick to sort the list, K, E, Y, B, O, A,R,D in alphabetical order. (2 Mark) Q3. Explain Master Theorem .Using Master Theorem solved the following recurrence. relation (2 Mark) a) T(n)=9T(3n/4)+n3 b) T(n)=4T(n/16)+1 Q4. Write the Recursive algorithm for Binary search .Consruct the recurrence relation for recursive algorithm and solve using bachward Subtution. (2 Mark) Q5. Evaluate the polynomial f(x)=100x5+30x42x3+3x2+4x10, for x=4, using Horner Rule. (2 Mark)