Question: Given a dictionary of friendship, find the shortest path/network between two persons if it exists. — let network = [
"Bob" : ["Bill", "Adam"],
"Bill" : ["Bob", "Hank"],
"Tom" : ["Jane"],
"Jane" : ["Tom", "John", "Ball"],
"Adam" : ["Bob"],
"Ball" : ["John", "Jane"],
"Hank" : ["Bill"],
"John" : ["Jane", "Ball"]
] For example, given “Adam” and “Hank”, you should return “Adam->Bob->Bill->Hank”,
