6. Use the relation R={(1,2),(2,3),(2,4),(3,1),(3,4),(4 ,1),(4,2)} to draw the digraph. Use the Floyd and Warshall algorithm to calculate the shortest
path. The weight for each set is as follows:
[20 Marks]
(1,2) - 3
(2,3) = 12
(2,4)=5
(3,1) = 4
(3,4) = 4
(4,1)=2
(4,2)=-4

38+105= 143, 39+104=143, and you will find then adding the numbers on opposite sides, moving inwards yields the answer 138 every time. because of this, you’re going to multiply 138 times the number of pairs, which is 34. therefore, 34*138= 4692(i’m sorry if it’s the wrong numbers, but it’s the right concept)

Num of plants = (original#ofplants)*(1.6)^t