Given a $9-$element array with distinct elements, say $\{$x$1,$ x$2,$ x$3,$ x$4,$ x$5,$ x$6,$ x$7,$ x$8,$ x$9\},$

it is known that x$1<$ x$2<$ x$3,$ x$4<$ x$5<$ x$6,$ x$7<$ x$8<$ x$9$ and x$2<$ x$5<$ x$8.$ How

many comparisons do you need to find the median of this array with the minimum

number of comparisons for the worst case?