This is problem 5 of section 3.1 in introduction to the design and analysis of algorithms third edition by Anany Levitin. Your textbook solution page has no solution to this problem yet. Please help!

5. A network topology specifies how computers, printers, an are connected over a network. The figure below illustrates three common topologies of networks: the ring, the star, and the fully connected mesh. ring star fully connected mesh You are given a boolean matrix A[0.-1, 0. -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 Design a brute-force algorithm for this task and indicate its time efficiency class