Consider a modification of the quick$-$sort algorithm so that, instead of selecting a random

pivot, the last element in an n$-$element sequence is selected as the pivot. Describe the

kind of sequence that would cause this version of quick$-$sort to run in $($a$)$ O$($nlogn$)$ time

and $($b$)$ Q$($n$2$

$)$ time.