Read the steps below to recall the Binary Search algorithm and write it in the form of

a pseudo$-$code. Then, answer the questions below.

Step $1$: Define variables left and right. Initialize them with the start index and the end

index of the array, respectively.

Step $2$: Calculate the mid$-$point of the current search space as $($left$+$right$)/2.$ If left is

greater than right $($stopping condition$),$ return $-1.$

Step $3$: Compare the key element K with mid$-$point. If they are equal, return mid index. If

K is greater than mid$-$point, go to step $4.$ Otherwise, go to step $5.$

Step $4$: Repeat step $2$ after reassigning the value of left to search in the right half of the

current search space.

Step $5$: Repeat step $2$ after reassigning the value of right to search in the left half of the