Your goal is to RECURSIVELY determine how many "long diagonals" would be traversed in a 'length' by 'width' rectangular array, if that array was being "traversed diagonally". Examples explaining "long diagonals" and what it means to be "traversed diagonally" are provided on paper. Please refer to the paper examples and instructions. Please DO NOT write on the paper copies. You have scrap paper to write on instead. As preconditions, you may assume that 'length' and 'width' are both greater than 1. For example, if 'width' is 9 and 'length' is 4, the number of long diagonals in the traversal would be 6. If 'width' is 25 and 'length' is 24, the number of long diagonals in the traversal would be 2. Your solution MUST use RECURSION in a meaningful way to solve the problem! You may choose to use a helper method to handle the recursion, or your original method can be recursive with a non-recursive helper method, or you can just have your original method be recursive with no helper method.