$24.$ Given a $6-$element array with distinct elements, say $\{$x$1,$x$2,$x$3,$x$4,$x$5,$x$6\},$ it is known that x$2<$ x$1,$ x$4<$ x$3,$ and x$6<$ x$5.$ How many comparisons do you need to find the $3$rd largest element for the worst case?