Each square on a chess board can be described by a letter and number, such as g5 in this example: The following pseudocode describes an algorithm that determines whether a square with a given letter and number is dark (black) or light (white). If the letter is an a, c, e, or g: If the number is odd: color = "black" Else: color = "white" Else: If the number is even: color = "black" Else: color = "white" Trace this algorithm by making a table such that: The table headers are the variables (one column per variable) The first row shows the initial (assumed) values of the variables Each following row shows a value change in a variable Give a set of four test cases for the algorithm from question 9 that covers all branches