Suppose you call bfs_shortest_paths (graph, 'a') on the graph above. This function returns dictionaries distance and predecessor. Write down the contents of these dictionaries as they are when the function exits. Suppose you call bfs_shortest_paths (graph, 'a') on the graph above. This function returns dictionaries distance and predecessor. Write down the contents of these dictionaries as they are when the function exits