Which of the following statements accurately describes BFS compared to DFS$?$

a$.$ BFS is implemented using recursion

$$ b$.$ BFS is less efficient in terms of time complexity compared to DFS

$$ c$.$ BFS uses less memory than DFS

$$ d$.$ BFS finds the shortest path between two nodes in a weighted graph