6. What is time complexity of the given function? 3. Marks 7. Find all possible topological sorting of the given graph.? 3 Marks 8. Consider that the quicksort is applied to sort n numbers. If the quicksort algorithm is modified to select 7nth smallest element as pivot using an algorithm working in O(n2) time complexity. What will be the worst-case time complexity of the modified quicksort algorithm. 9. What is the time complexity of the function T(n) function defined by? 3 Marks 3 Marks T(n)={12T(2n)+nifn=1otherwise} 10. What is NP-Complete problem. How can you prove that a given problem is NP-Complete? 3Marks