6. Suppose We have a 2-dimensional structure with n rows. There are n rows and each row has length n (same as in the previous question). This time, each row is already sorted. We are searching for a value inside that structure using binary search, one row at a time, until we find (or not find) that value. (a) What is of the best case? [2pts] Big Theta in the best case as a function of n Justify your answer. [3 pts] (b) What is of the worst case? [2pts] Justify your answer. [3pts]