Question 8Which of the following are true of breadth-first search? Select all that apply.Breadth-first search is implememted useing a queuebreadth

The question seems to be incomplete. However, I can provide information on the part of the question that is given.

"Breadth-first search is implemented using a queue" - This statement is true.

Breadth-first search (BFS) is a graph traversal algorithm that explores all the vertices of a graph in breadth-first order, i.e., it explores all the vertices at the present "depth" before going to the next level of depth. It uses a queue data structure. The algorithm starts from a source node and visits its adjacent nodes first before going to the next level nodes. It uses a queue to remember to visit the next node and to keep track of the nodes to be explored at each level.