Q. No. Question Script 1a. Solve the following recurrence relation T(n)= V2T(n/V2) + nlogn Apply Strassen's Matrix Multiplication to find product of following matrices: 1111 0101 1b. 10101010 0101x1111 1111 1001 Find the solution to maximize the profit on given data and return the X; (solution) 2a. vector for following data; Number of items: n=8, Total Capacity M=17. Profit P= {10, 15, 8, 7, 3, 15, 8, 27} and weight W = {5, 4, 3, 7, 2, 3, 2, 6}. Refer below graph, find the all pair shortest path using Floyd-Warshall Algorithm. 3 2b. 7 1 The aim of problem is to assign a unique query to every database engine such that the total cost of query processing is minimized. The constrained is defined as follows: 1 i assigned Vij=1,2,..n o if unassigned 72 72 =l or 1 with Xij 3 You need to minimize the objective function f where cij is the cost assigning i to j. Query1 Query2 Query3 Query4 Engine 1 7 42 47 10 Engine2 12 28 4 20 Engine3 34 14 15 10 Engine4 12 26 14 8