Suppose you must solve planning problems for cleaning a house. Various rooms can be dusted (making the room dust-free) or swept (making the room have a clean floor), but the robot can only perform one action at a time. Additionally, the robot can't move between rooms while performing an action. Which planning algorithm would be most suitable for this scenario?

a) Depth-first search
b) Breadth-first search
c) A* search
d) Hill climbing