Question $4$: Debugging TaskThe following Python code is intended to implement the Binary Search algorithm, but it contains an error. Identify and correct the error.def binary$\_$search$($arr$,$ target$)$:low $=0$high $=$ len$($arr$)$while low $<=$ high:mid $=($low $+$ high$)//2$if ar$[$mid$]==$ target:return midelif arr$|$mid$]<$ target:low $=$ mid $+1$else:high $=$ mid $-1$return $-11.$ What is the error in the code?$2.$ Rewrite the corrected code below:Bonus Question $($Optional$)$:Explain why Merge Sort is more suitable for large datasets compared to Bubble Sort