Hello, srk619!

I can help with the first two parts . . .

(a) Draw the graph with this adjacency matrix:

. . . . .

. . . . . . . . . .

(b) Calculate and hence say many paths of length 2

there are between vertex 1 and vertex 3.

. - . - . - . . .