c$)$ This is a highway map with cities and distances between them. The continuous lines indicate highway connections between cities, and dotted lines are direct distances.

$\begin{array}{cc}\text{D}\text{i}\text{r}\text{e}\text{c}\text{t}Distances\text{f}\text{r}\text{o}\text{m}\text{C}\text{h}\text{i}\text{c}\text{a}\text{g}\text{o}& ?\\ \text{M}\text{i}\text{a}\text{m}\text{i}& 2000\\ NYC& 800\\ \text{B}\text{o}\text{s}\text{t}\text{o}\text{n}& 900\\ \text{D}\text{a}\text{l}\text{l}\text{a}\text{s}& 1200\\ SF& 2200\\ LA& 2400\end{array}$

a$)$ Provide a search tree. Dallas is the starting point, and Chicago is the goal destination.

b$)$b$)$ Using A $*$ Search algorithm, find a path from Dallas to Chicago. Show all steps for full credit.