How many nodes were expanded $($i$.$e$.,$ how many iterations did it take$)?$

What was the path computed by this search strategy?

Was the computed path optimal in number of "hops"?

Was the computed path optimal in actual cost?

What is the ideal$/$easiest data structure to use for the fringe?

Where $g=$ level of shallowest goal state, $d=$ max depth of the tree, and $b=$ the branching factor:

What is the time complexity of ucs?

What is the space complexity of UCS?