Please comment on each line of code, what it does:

1: {Determines whether the graph is a ring, a star, or a fully connected mesh}

2: {Input: Boolean adjacency matrix A[0..n 1, 0..n 1] of the graph}

3: {Output: 1 denoting a ring, 2 denoting a star, or 3 denoting a fully connected mesh}

4: d0 0

5: for c1ton1 do

6: d0 d0 + A[0, c]

7: end for

8: if d0 = 2 then

9: return 1

10: end if

11: if d0 =1 then

12: return 2

13: end if

14: d1 0

15: for c0ton1 do

16: d1 d1 + A[1, c]

17: end for

18: if d0 = d1 then

19: return 3

20: else

21: return 2

22: end if