(c) Pseudo Code shown in Figure Q2(c)(i) is an algorithm for binary searching for an array with n number of elements. By applying this algorithm, show step by step approach on how to find number 11 in an array as shown in Figure Q2(c)(ii). lowf 0 high n-1 while (low S high) do ixt (low + high)/2 if (t = A[ix]) then return ix else if (t