$25.$ Given two ordered arrays $\{$a$1,$a$2,$a$3,$a$4,$a$5\}$ and $\{$b$1,$b$2,$b$3,$b$4,$b$5\}$ with a$1<$ a$2<$ a$3<$ a$4<$ a$5$ and b$1<$ b$2<$ b$3<$ b$4<$ b$5,$ we want to find the $5$th largest element of these ten elements $($assume that all the elements are distinct$).$ After we do the first comparison on a$3$ and b$3,$ we get a$3>$ b$3.$ How many more comparisons do we need to find this element?