What single line of code would need to be changed if you wanted to do a Binary Search on a list sorted in descending order?$$ How would you change it$?$

Algorithm binarySearch$($a$,$ first, last, desiredItem$)$

mid $=($first$+$last$)/2$

if $($first $>$ last$)$

return false

else if $($desiredItem equals a$[$mid$])$

return true

else if $($desiredItem $<$ a$[$mid$])$

return binarySearch$($a$,$ first, mid$-1,$ desiredItem$)$

else $//$ desiredItem$>$ a$[$mid$]$

return binarySearch$($a$,$ mid$+1,$ last, desiredItem$)$

$$