Consider the graph adjacency matrix 1 10 2 3 4 5 10 10 2 0 0 1 1 1 3 10 000 4 0 0 1 0 0 5000 10 How many paths are there from vertex 1 to vertex 5 of length either 1 edge or 2 edges or 3 edges or 4 edges? a) 2 b) 3 c) 4 d) 5