6. (20 pts) Perform Simulated Annealing search to maximize value in the following search space. Recall that a good move (increases value) is always accepted (P=1.0); a bad move (decreases value) is accepted with probability P=eSVALT. where VAL=VAL(Next)VAL( Current ). Use this temperature schedule: A. Analyze the following possible moves in the search and complete the table below. The first one is done as an example. B. Answer the following: At Time =100, is the search more likely to be in state A or in state C ? (ignore E,G ) At Time =200, is the search more likely to be in state A,C, or E ? (ignore G ) At Time =300, is the search more likely to be in state A, C, E, or G