(Algorithms)

Can you please help me with this question? I tried to solve them but it's really a hard course. I will highly appreciate your help.

Write True or False in front of each of the following statements: 1) In a max-heap, first item is the highest and second item is the second highest element in the array. 2) Mergesort will run faster if the input array is already sorted. 3) Binary Search will do maximum work if the key we are searching for is not in the array. 4) Priority queue is just like a normal queue except that it has 'time' as the priority. 5) Applying divide and conquer in matrix multiplication involves 8 subproblems. 6) In transportation graph, vertices represent highways and edges represent ctroat intersections. 7) In general, running time of insertion-Sort belongs to both (n) and O(n2). 8) n3+20n=(n2). 9) Dynamic programming can solve LCS problem in polynomial time. 10) All functions are asymptotically comparable