Write a method that returns how many options there are for a knight to move on an otherwise EMPTY chess board, given the knight's starting position on that chess board. The knight is the only piece on the board! A chess board consists of an 8 by 8 grid of squares. We will number the rows 1 through 8 and the columns 1 through 8. So (5,2) would indicate the square in row 5, column 2. Knights move in a very specific way. They go 1 square in one direction, then 2 squares in a perpendicular direction. For example, if a knight is located at (5,2) it could move to any of these squares: (3,1), (3,3), (4,4), (6,4), (7,1), (7,3). There are no other squares it could move to. At most there are 8 squares a knight could move to. In the example above, there were 6 possible squares the knight could move to. On an empty chess board there will always be at least 2 places for the knight to move. Your goal is to return the correct number of squares the knight could possibly move to, given the starting position of the knight. As always, look at the test data for examples.