Which is true statement?

(A) Breadth first search is shortest path algorithm that works on un-weighted graphs
(B) Breadth first search is shortest path algorithm that works on un-weighted graphs
(C) Both of above are true
(D) None of above are true