Implement a Breadth-First Search of the people in the network who are reachable from person id 3980. You can implement BFS with a queue and the pseudocode is given in CLRS. Print out the distance (number of connections) from person 3980 to every person who is reachable from 3980 via edge traversals. Note that not all people in this network may be reachable via edge traversals from user id 3980, so users that are not accessible can be ignored in BFS. All the distances printed out are the shortest paths from 3980 and another person as determined by BFS. For example: "3985 is at a distance of 1 from 3980.""4014 is at a distance of 2 from 3980."

Implement a Breadth-First Search of the people in the network who are reachable from person id 3980. You can implement BFS with a queue and the pseudocode is given in CLRS. Print out the distance (number of connections) from person 3980 to every person who is reachable from 3980 via edge traversals. Note that not all people in this network may be reachable via edge traversals from user id 3980, so users that are not accessible can be ignored in BFS. All the distances printed out are the shortest paths from 3980 and another person as determined by BFS. For example: "3985 is at a distance of 1 from 3980.""4014 is at a distance of 2 from 3980."