13. We need to merge 3 ordered arrays with a,b, and c elements, respectively, and get an ordered array containing all these elements for the worst case. To this end, we apply the Greedy Strategy to select two shortest arrays to merge first when we select two of the 3 arrays to merge. Do you think that the Greedy Strategy would result in an optimal solution in this particular case? (a) yes (b) no 14. Given an array with n elements (n5), we want to find the third largest element in this array. In order to find the third largest element, do we have to find the largest element first, then the second largest element next, and finally the third largest element? (a) yes (b) no 15. To recover the array 23,17,14,6,13,10,1,5,7,12 to a max-heap, how many swap operations do you need? Ans: 16. Given a max-heap whose values correspond to the array indices from 1 through n, what is the smallest possible index for a node with height 2 in the heap