A carnival game has a very large hoard marked out on a grid of squares so that each square has sides 8.8 cm. A one dollar coin with diameter 2.7 cm is tossed from a short distance onto the grid. [f the dollar coin lies entirely in any of the squares, you get it back, plus you win a dollar! If any part of the coin lands on any grid line, you will lose your coin, and thus, lose a dollar. Note: You can assume that the board is very large so that any dollar coin will land somewhere on the board, and that the lines dividing the squares have an ignorable thickness. You can also assume that the dollar coin is equally likelyto land anywhere on the board. a. Show that this game is not considered to be \"fair". I). Determine the length of each side [to 3 d.p.] in order for the game to he considered \"fair"