In the following network, the link from F to E is the fastest way to send data from F to E. However, that direct link has just been downgraded to 10 from 8 regarding the cost of transmission. Given this new information and using Dijkstra's algorithm, compute the new shortest path from F to E for routing data for the following network You do not need to show the key steps of the process with figures but just explain them with a sentence or two for each key step. A 4 5 B E 1 2 8 6 U F LL 3 7 D