BFS Properties and Complexity

Breadth-first search explores level by level and is complete and optimal for uniform costs.

For breadth-first search on a tree with branching factor b and shallowest goal at depth d, what is the time complexity?