Construct the weight matrix W for the directed graph below (clarification: the edge from c to b has weight 7, while the edge from d to a has weight 6).

Whenever applicable, use i for infinity.

W	a	b	c	d
a	Answer	Answer	Answer	Answer
b	Answer	Answer	Answer	Answer
c	Answer	Answer	Answer	Answer
d	Answer	Answer	Answer	Answer

Below, apply Floyd's algorithm for computing the all-pairs shortest distance matrix. Whenever applicable, use i for infinity.

Show the contents of the D¹ matrix:

W	a	b	c	d
a	Answer	Answer	Answer	Answer
b	Answer	Answer	Answer	Answer
c	Answer	Answer	Answer	Answer
d	Answer	Answer	Answer	Answer

Show the contents of the D² matrix:

W	a	b	c	d
a	Answer	Answer	Answer	Answer
b	Answer	Answer	Answer	Answer
c	Answer	Answer	Answer	Answer
d	Answer	Answer	Answer	Answer

Show the contents of the D³ matrix:

W	a	b	c	d
a	Answer	Answer	Answer	Answer
b	Answer	Answer	Answer	Answer
c	Answer	Answer	Answer	Answer
d	Answer	Answer	Answer	Answer

Show the contents of the D⁴ matrix:

W	a	b	c	d
a	Answer	Answer	Answer	Answer
b	Answer	Answer	Answer	Answer
c	Answer	Answer	Answer	Answer
d	Answer	Answer	Answer	Answer

3] 6x7