Which algorithm do you expect to run fastest? * 1 point \begin{tabular}{|l|l|} \hline 22 & def bs3 (L, item ): \\ 23 & left, right =0,1en(L) \\ 24 & while right = left >1: \\ 25 & median =( right + left )//2 \\ 26 & if item left and L[left]== item \\ \hline \end{tabular} \begin{tabular}{|lr|} \hline 22 & def bs3(L, item ): \\ 23 & left, right =0,1en(L) \\ 24 & while right 1eft>1: \\ 25 & median = (right + left) // 2 \\ 26 & if item left and [ left ]== item \\ 30 & ref \\ \hline \end{tabular} bs1 bs2. bs 3