Planning with STRIPS $[15$pts$]$ A robot must execute a sequence of actions to move from its initial position to deliver an object to a specific location. The problem can be modeled using the STRIPS formalism. Problem Description: $1.$ Initial State: The robot is in Room A$.$ The object is in Room B$.$ The robot's hands are empty. InitialState$=\{$At$($Robot$,$A$),$At$($Object$,$B$),$HandsFree$\}2.$ Goal State: The robot must deliver the object to Room C$.$ GoalState$=\{$At$($Object$,$C$)\}3.$ Actions: The robot can perform the following actions: o Move$($X$,$ Y$)$: Move from room X to room Y $$ Preconditions: At$($Robot$,$X$)$ Effects: At$($Robot$,$Y$),$At$($Robot$,$X$)\backslash$ o Pick$($Object$,$ X$)$: Pick up the object in room X$.$ Preconditions: At$($Robot$,$X$),$At$($Object$,$X$),$HandsFree $$ Effects: Holding$($Object$),$At$($Object$,$X$),$HandsFree o Put$($Object$,$ X$)$: Put down the object in room X$.$ Preconditions: At$($Robot$,$X$),$Holding$($Object$)$ Effects: At$($Object$,$X$),$ HandsFree, $$Holding$($Object$)$