Hello, can you help me with questions 3 and 6?

The algorithm you will implement below is based on the following observation. There is a directed path in G connecting a: to y if and only if one of the following holds: a there is a directed edge from I to y, 0 there is a directed path from x to y passing through the vertex a. 0 there is a. directed path from 9: to 3; only passing through vertioes from {(1, b}, 0 there is a directed path from a: to 3; only passing through vertioes from {a, b, c}, I there is a directed path from :r to 3; only passing through vertioes from {(1, b, c, d}. a there is a directed path from a: to 3; only passing through vertioee from {a,b,c, d',e}. 3. Construct the matrix Mia] whose xy-entry' is 1 if either of the rst two bullet points above are satised. This matrix can be obtained by modifying M, changing a zero to a one when a path from :1: to 11; passing through a exists. 4. Next construct the matrix M {M} whose zyentry is 1 if any of the rst three bullet points are satised. Then construct M {\"1\"}, and so forth. Each time, use the previous matrix to construct the new matrix. 5. The last matrix Mi\">"'v'r\"v"'} is the adjacency matrix for El". Use this to draw the digraph for 3+. 5. Finally, write a. few paragraphs describing how this algorithm works in general. Be sure to include: what the algorithm does (What is the input? What is the output?); and how the algorithm works