Given the list of code words $\{000000,100110,001011,101101,010101,110011,$

$011110,111000\}$ and a received vector $($r$1,$ r$2,...,$ r$6)=(-2,1,2,-2,-3,-1),$ please use the A$*$ algorithm to find a path from the root of the code tree to a goal node such that the cost of the path is minimum among all paths from the root to a goal node. Note that in your answer, you need

to also draw your searching tree for the given instance.