Mark the following statements as either true or false: (20 marks, 2 mark each) 1) Linear search in an array A[n] involves (logn) comparisons. 2) If the "insertion-sort" is implemented on the array A[44,25,12,61,31], after the first two cycles the array will be A[12,25,44,61,31] 3) To represent hierarchical relationship between family members, a graph data structure is suitable. 4) Any node in the path from the root of a tree data structure to the destination node is called ancestor node. 5) The recurrence relation that arises in relation with the complexity of binary search is T(n)= T(n/2)+k, where k is constant 6) Minimal spanning tree algorithm belongs to the brute-force paradigm 7) In linear search, search start randomly from any element in the list and check all the other element in the list. 8) KMP searching algorithm is faster than the Linear search 9) Searching in a list for an unavailable value will lead to average case performance. 10) The sequence [20,15,18,7,9,5,12,3,6,2] is a max-heap