Suppose that the goal state is $H$ on the graph shown below.

Run iterative deepening search $($IDS$),$ and show the traversal order, i$.$e$.,$ list the nodes $($vertices$)$ in the order in which each traversal visits $($explores$)$ them. Please enter the final list in the box below. Your answer should be a string with $A$ as your first character and $H$ as your last character. For auto grading, don't include arrows or spaces in your submission. For example, if you believe the list is in this order: A$-$B$-$E$-$H$,$ please enter ABEH in the box.

$$