Total $=15$ marks $($answer each question in the given space$)1)(8$ marks$)$ If we call BuildHeap on the given array A $=[2,3,4,5,6,7,8,9,10,11,12]$ then$1.$How many times Heapify will be called by BuildHeap $($non recursive calls$)?2.$Total how many times Heapify will be called recursively $?3.$After BuildHeap call, which elements in A will not move from their original location. $4.$Write the content of the array after BuildHeap call$\mathrm{.}2)(7$ marks$)$ How would you modify LCS algorithm so that it solves Longest Common Substring problem using dynamic programming. Write the algorithm for it$.$