Question 17 (2 points) You are designing a local search algorithm to ace this midterm. For simplicity, assume there are 20 multiple choice questions with 4 choices per question, and 10 short answer questions with single digit integer answers. So, each short answer question has 10 possible answers (0-9). The neighbourhood for the algorithm is defined by changing the response to any one multiple choice question or by changing the response to one short answer question by up to two in either direction. You can assume that 9 wraps around to 0; e.g., you can change the response to a short answer question from 9 to 7, 8, 0 or 1. What is the size of the neighbourhood for your algorithm? Input your answer as a whole number