Q2. Given an n m (2D) array A[., .], A[i, j] is said to be a local max if A[i, j] A[i+a, j+b] for each a {1, 0, 1} and b {1, 0, 1} if 0 i+a n1 and 0 j + b n 1. Design an efficient algorithm to compute all the local maxima, using divide and conquer technique.