Which of the following statements on BFS are true $($always$)?$

As always, BFS is as defined in the script, in the default$-$form $($with a start vertex$).$

The runtime of BFS might be worse than linear time for graphs with very many edges.

For digraphs, BFS does not compute distances from the start vertex.

If we watch the d$-$values of the vertices on the queue, then we will first see value $0,$ then values $1($at least once$),$ then values $2,$ then values $3$ etc., without skipping values or seeing a smaller value again.

The d$-$values are the distances from the start vertex.