Im confused on what it is asking and how to get the all the 2 and 3 seqruence paths. I would like the answer that would be easy to put into Mathmatica Code

Consider the diagram below of 8 locations in seattle. The lines (edges) connecting those locations represent a route (either bus, light rail, or monorail) that exists between those locations (without a transfer, that is, without having to transfer to a different bus or change modes of transportation)

A.) Find the adjacency matrix A for this graph using the following labeling for the vertices (nodes) of the graph:

1 = Seattle Central College (SCC) 2 = University District (U. Disttrict) 3 = UW Husky Stadium 4 = Pioneer Square 5 = Safeco Field / Centurylink 6 = Pike Place Market 7 = Space Needle 8 = Green Lake Hint: You may want to sketch a graph of just vertices and edges on a separate sheet of paper first.

B.) Find A^2 and use this to find all two-edge sequences (paths).

C.) Find A^3 and use this to find all three-edge sequences (paths).

D.) What locations have two or more stops between them?

u. Green Lake ul tus Stadiurm SPace weedle SCO Pike Plas Harket oneen u. Green Lake ul tus Stadiurm SPace weedle SCO Pike Plas Harket oneen