Write a java program for this pseudocode for this situation: You are given a Boolean matrix A[0..n 1, 0..n 1], where n > 3, which is supposed to be the adjacency matrix of a graph modeling a network with one of these topologies. Your task is to determine which of these three topologies, if any, the matrix represents.

Pseudocode:

{Determines whether the graph is a ring, a star, or a fully connected mesh} {Input: Boolean adjacency matrix A[0..n 1, 0..n 1] of the graph} {Output: 1 denoting a ring, 2 denoting a star, or 3 denoting a fully connected mesh} d0 0 for c 1 to n 1 do d0 d0 + A[0, c] end for if d0 = 2 then return 1 end if if d0 = 1 then return 2 end if d1 0 for c 0 to n 1 do d1 d1 + A[1, c] end for if d0 = d1 then return 3 else return 2 end if