1 a) Explain very briefly why the breadth first search algorithm takes O(V+E) time 4 marks b) 3 marks Explain the advantages and the disadvantages of Bellman Ford algorithm over Dijkstra's algorithm. c) Use the Dijkstra's algorithm to determine the shortest path from A to all vertices. 10 marks Clarity is expected while answering this question. B 15 10 1 12 Start D E 2. 15 10 d) 3 marks Dijkstra's algorithm uses the priority queue data structure. If the priority queue is built using array (and not heap), what would be the time complexity of the Dijkstra's algorithm