Q. 3 Consider the modified Partition algorithm named as Modified Partition, which is 7(4+3) modified as: within a[m],a[m+1].... a[p-1] the elements are rearranged in such a manner that if initially t = a[m], then after completion a[q] = t for some q between m and p-1, a[k] >t for m