Consider the following linking matrix showing connections between the websites A, B, C, D, E, F, G, and H:

Exercise 4.6 Consider the following linking matrix showing connections between the websites A, B, C, D, E, F, G, and H: A B C DEF G H A 0 0 0 0 1 0 0 0 B 0 0 0 0 0 0 0 1 C 0 D 0 0 0 0 0 H 0 0 0 1 0 0 0 0 Enter this matrix into MATLAB with the command 0,0,0,0,0,0,0,1; 1/2,0,1/2,e,0,0,0,0; 1/2,0,0,0,0,0,0,0 0,1/2,0,e,e,e,0,0; 0,0,0,1,e,e,e,0 a. Let eo = (1, 1, 1, 1, 1, 1, 1, 1)T, and define end-Len (which is the same as saying en-Leo) Use MATLAB to compute e10. How large must n be so that each entry of en changes by less than 196 when we increase n by 1 ? Don't try to get an exact value, just try to get a value for n that's big enough.] b. In the graph of the network of webpages represented by L, which vertices have an edge going out and pointing toward website C? Which vertices do the edges coming out of C point to? (Here, by graph we mean a collection of vertices and edges.)