2. A. Suppose you have a 2-dimensional array int [ JI] distance, and you want to check for all pairs of indices j and k, that distance[il[k] is the same as distance[k]j]. Finish the code below so that it does this. For full credit, be careful to check each pair of indices just once. E.G., if you check forj-1, k-2 you should not also checkj-2, k-1. Assume distance has n rows and n columns // if distanceljl[k] is the same as distance[k]i] for all j, k return true, else false public static boolean checkDistance(int [ J[ ] distance, int n)f for( B. In big-O terms, how much work will the program in Part A above do in the worst case