Which is true regarding BFS (Breadth First Search)?
(a) BFS will get trapped exploring a single path
(b) The entire tree so far been generated must be stored in BFS
(c) BFS is not guaranteed to find a solution if exists
(d) BFS is nothing but Binary First Search
