A simple well-known game, tic-tac-toe, is played on a three-by-three grid of squares by two players. The Players alternate turns. Each player chooses a square and places a mark in a square. (One player uses X and the other O). The first player with three marks in a row, in a column, or on a diagonal wins the game. A logic circuit is to be designed for an electronic ti-tac- toe that indicates the presence of a winning pattern. The circuit output Wx is a 1 if a winning pattern is present for X and Wo is 1 if a winning pattern for the O's is present. For each of the nine squares, Xi is 1 if the player one put an X and it is O if player 2 put an O in that location. a) Using Boolean algebra write the equations Wx and Wo for the following pattern of signals for the squares: X, Xx Xx X. Xs X X, Xs X. b) Mininmize the equations for Wx and Wo as much as possible, using Boolean algebra. What is the GI cost of your function?