VI. GP Apply Genetic Programming to the problem of navigating a maze. Function Set = {If-Movement-Blocked, While-Not-At-Cheese*} Terminal Set = {Move-Forward one space, Turn-Left 90 degrees, Turn-Right 90 degrees} Fitness function: Each function and terminal other than the root node shall cost one unit to execute. If the mouse spends more than 100 units, it dies of hunger. The fitness measure for a program is determined be executing the program, then squaring the sum of the total units spent and the final distance from the exit. 1. Draw the parse tree for the following program. While not at the cheese If the way ahead is blocked Turn right 90 degrees Move forward one space Move forward one space Move forward one space Otherwise Move forward one space Turn right 90 degrees Move forward one space Move forward one space Turn left 90 degrees If the way ahead is blocked Turn left 90 degrees Otherwise Move forward one space 2. Based on the above program, use mutation to generate a new program. You can choose any mutation point at your preference. Write down the new program. You should circle the mutation point on the above parse tree. 3. Use the fitness function provided to evaluate the new program generated above. Is the new program better than the original? Why or why not? VI. GP Apply Genetic Programming to the problem of navigating a maze. Function Set = {If-Movement-Blocked, While-Not-At-Cheese*} Terminal Set = {Move-Forward one space, Turn-Left 90 degrees, Turn-Right 90 degrees} Fitness function: Each function and terminal other than the root node shall cost one unit to execute. If the mouse spends more than 100 units, it dies of hunger. The fitness measure for a program is determined be executing the program, then squaring the sum of the total units spent and the final distance from the exit. 1. Draw the parse tree for the following program. While not at the cheese If the way ahead is blocked Turn right 90 degrees Move forward one space Move forward one space Move forward one space Otherwise Move forward one space Turn right 90 degrees Move forward one space Move forward one space Turn left 90 degrees If the way ahead is blocked Turn left 90 degrees Otherwise Move forward one space 2. Based on the above program, use mutation to generate a new program. You can choose any mutation point at your preference. Write down the new program. You should circle the mutation point on the above parse tree. 3. Use the fitness function provided to evaluate the new program generated above. Is the new program better than the original? Why or why not