Additional Homework 4 Problems CompSci 161-Fall, 2017-Dillencourt 1. Consider the problem of searching in a sorted matrix. That is, you are given an x A, where each entry is an integer n n matri . Each row of the matrix 1s sorted In ascending order, and each column is also sorted in ascending order. Given a value r, the problem is to decide whether r is stored somewhere in the array (i.e., whether there is some i and j such that Ailj]-r) a) One way to solve this problem is to do binary search in each row. What is th