Solve fast please within 5 minutes. A small one two line explanation will be good.

Consider the given adjacency list of a directed graph and tell that how many times the vertex 'C' is visited if traversed using BFS algorithm? A -> B -> C-> DB -> C-> EC- > D -> ED -> A -> C-> EE -> A -> B Select one: O a. Can be any number of times O b. Twice O c. Thrice O d. Once