Write a java program to creates a 2D array of 5x5 values of type boolean. Suppose indices represent people and that the value at row i, column j of a 2D array is true just in case i and j are friends and false otherwise.

1: Initialize your array to represent the following configuration:

2: Write a method to count how many pairs of friends are represented in the array.

Note that each friendship pair appears twice in the array, so in the example above there are 6 pairs of friends).

3: Write a method to check whether two people have a common friend.

For example, in the example above, 0 and 4 are both friends with 3 (so they have a common friend), whereas 1 and 2 have no common friends. The method should have three parameters: a 2D array of boolean representing the friendship relationships and two integers i, j. The method should return true if there is an integer k, such that i is a friend of k and k is a friend of j and return false otherwise.

#101234 (* means "friends" 0