undefined

1 a 4 marks Explain briefly the use of color codes in BFS algorithm. Explain what each color represents. b) Explain how Bellman-Ford algorithm detects negative weight cycle in a graph. 3 marks You do not need to write any pseudocode/code. You need to simply explain the idea. A student applied Dijkstra's algorithm on the following graph to obtain the 10 marks shortest path from A to all vertices. c) B 3 E D Determine the shortest distance to each of the vertices the student would find. Comment on your answer. d) 3 marks A graph G contains 20 vertices. Without using any calculator, determine the maximum number of edges the graph can have. What would be the time complexity of applying Bellman-Ford algorithm on the graph of n vertices