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

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

$2.$ Breadth$-$first search solves the single source path problem in an undirected graph.

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

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