Consider a board similar to a chess board with 100 columns and 100 rows. There are 10,000 cells in this board. A coin is positioned at the upper left corner, the starting point, at cell (0,0), column 0 and row 0. Your goal is to get the coin from (0,0) to the bottom right, last column, last row. The coin can only be moved one position at a time, either up, down, right or left. Write a small fragment (not a whole program) with at most 7 lines to move the coin from (0,0) all the way to the bottom, as described above. Assume all libraries are included.