Show your work for the previous problem. Answer Format: For…

Show your work for the previous problem. Answer Format: For full credit, your answer must: 1. Provide the formula(s) that you are using with variables only. 2. List the values of the variables. 3. Provide the result. Examples:  Formula used: c=2*t values of the variables:  t=2  result:    c=4 Formula used: E=mc^2 values of the variables: m=2, c=4 result:  E=32    

Which routing algorithm, Dijkstra or Bellman-Ford, is better…

Which routing algorithm, Dijkstra or Bellman-Ford, is better at responding quickly to changing connections in the network, i.e., quicky creating new routing tables when one new node is added, or when a link goes down.   Answer Format Write your choice (Bellman-Ford or Dijkstra): [RoutingAlgorithm] Provide your reason for your choice: [Reason] (one or two sentences in text)