C++

UNIC 6. In a two dimensional array, suppose indices represent people and that the value at row l, column j of a the array is true just in case i and j are friends and false otherwise. Initialized your array to represent the following configuration: 2 a) Write the code that counts 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. Write a function 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. Test this function in the main() program. b) (20 points)