2. (20 points) Packet Switching. You are given a connected directed graph where each vertex represents a network switch and each edge represents a link between two switches Based on its bandwidth, a link is labeled as either being fast (F) or slow (S) (a) (10 points) We would like to determine the path from a source location v to every other switch in the network with the least number of slow links. Determine the most efficient
OR
OR