$(25$ pts$)$ Use the Floyd$-$Warshall algorithm to find the shortest distances and paths between any pair of nodes in the graph below. $($Hint: First convert the mixed graph to a directed graph.$)$