Please answer fast to this AI problem.

Consider the following search space, node $S$ is the start state and $Z1$ and $Z2$ both satisfy the goal test. Arcs are labelled with the cost traversing between nodes, while the heuristic cost is annotated next to each node. Execute tree search for the following strategies. For each search strategy, $(1)$ show the order in which states ore expanded until the goal state is found; $(2)$ Show the path from $S$ to either goal state; and $(3)$ write down the cost of the path. In all cases, assume ties break based on alphabetical order. Both result and operation process are required in your answers for full credit.

UCS $($Uniform Cost Search$)$

Greedy Search

Iterative Deeping Search

A$*$ Search