choose Assume that the Floyd-Warshall algorithm is applied on a directed graph H. The graph H is represented by the adjacency matrix shown below, the adjacency matrixrepresents the initial distances between ith and jth vertices. Which of the following statements is false?A B C DA051 11B03 3с2 0 2D0Select one:O A. There is a directed edge of weight 3 from vertex B to vertex C.O B.There is a directed edge of weight 5 from vertex B to vertex A.O C.There is no edge between vertex C and vertex A.O D. There is a directed edge of weight 2 from vertex C to vertex B.OF There is a directed edge of weight 5 from vertex A to vertex B.

Answer the above question are as follows:

Assume that the Floyd-Warshall algorithm is applied on a directed graph H. The graph H is represented by the adjacency matrix shown below, the adjacency matrix represents the initial distances between ith and jth vertices. Which of the following statements is false? A B с D A 0 5 1 11 B ∞ 0 3 3 C 2 0 2 D 0 Select one: O A. There is a directed edge of weight 3 from vertex B to vertex C. O B. There is a directed edge of weight 5 from vertex B to vertex A. O C. There is no edge between vertex C and vertex A. O D. There is a directed edge of weight 2 from vertex C to vertex B. OF. There is a directed edge of weight 5 from vertex A to vertex B.