Consider the following strategy for playing tic-tac-toe: Put your mark in an available square that ranks the highest in the following list of descriptions: (i) a square that gives you three in a row; (ii) a square that would give your opponent three in a row; (iii) a square that is a double row for you; (iv) a square that would be a double row for your opponent; (v) a center square; (vi) a corner square; (vii) any square. A double row square for a player is an available square that gives the player two in a row on two distinct lines (where the third square of each line is still available, obviously). (a) Encode this strategy as a set of production rules, and state what conflict resolution is assumed. Assumptions: To simplify matters, you may assume that there are elements in WM of the form (line sq1: i sq2: j sq3: k), for any three squares i, j, k, that form a straight line in any order. You may also assume that for each occupied square there is an element in WM of the form (occupied square: i player: p) where p is either X or O. Finally, assume an element of the form (want-move player: p), that should be replaced once a move has been determined by something of the form (move player: p square: i). (b) It is impossible to guarantee a win at tic-tac-toe, but it is possible to guarantee a draw. Describe a situation where your rule set fails to chose the right move to secure a draw. (c) Suggest a small addition to your rule set that is sufficient to guarantee a draw.