Determine which statements below are true (multiple statements potentially true) about the BFS traversal of graph G starting from vertex A (no explanation needed): (a) No matter how BFS breaks the ties among neighbors, C is visited after B. (b) Once B is popped off the queue, its neighbors E and D are inserted at the end of queue. (c) C is visited before D because BFS favors a shorter path A-C than A-D even though C and D are equally many hops away from A.

B c) 1 14 8 5 A 3 3 F 16 2 D E 9