Dijkstra's algorithm

3. (a) For the basic Dijkstra algorithm, what are the possible inputs? What is the output? In our 12 marks] (b) For the Bellman-Ford algorithm, what are the possible inputs? What is the output? In our [3 marks] (c) Run the Bellman-Ford algorithm to find the shortest paths from all vertices to t, on the fol 4 marks] classification of algorithms, which type is it? classification of algorithms, which type is it? lowing weighted digraph: 3 To do so, complete a table (in your answer book) that starts as follows: (d) What is the length of a shortest path from a to t? [ mark]