Q3. Show the steps of Binary Search algorithm to find the index of 20 in the following list. Given a List with size N. Binaxxsearsh (A[0_N-1], value) { low = 0 high while (low <= high) { = N - 1 mid = (low + high) / 2 if (A[mid] > value) high = mid - 1 else if (A [mid] < value) low = mid + 1 %3D else return mid } return poteod } List: index 1 2 3 4 6. 7 8 10 11 12 values 10 13 20 22 24 30 33 40 46 50 51 52 60

Process or set of rules that allow for the solving of specific, well-defined computational problems through a specific series of commands. This topic is fundamental in computer science, especially with regard to artificial intelligence, databases, graphics, networking, operating systems, and security.