Problem $4$: $(15$ points$)$ Let A be an unsorted array of n positive integers. Recall the linear

time selection algorithm. Please refer to this algorithm for all problems below:

a$)$ Instead of finding the pivot element by computing the median of medians, let a pivot

be the last element of the current array. The rest of the algorithm is the same as above.

$1.(3$ points$)$ Will the algorithm still be correct? If yes, justify and give its asymptotic

running time. If not, show why.