Which of the following are true of breadth$-$first search? select all that apply.

Breadth$-$first search is implemented using a queue.

Breadth$-$first search solves the single source shortest path problem in an unweighted graph.

Breadth$-$first search solves the single source shortest path problem in a weighted graph.

Breadth$-$first search can be used in a directed or undirected graph.