Given the following recursive function signature, write the function code such that this function counts the number of different ways to reach a basketball score. Example: For the input 3, the output will be 4, since there are 4 different ways to accumulate 3: 1+1+1, 1+2, 2+1, 3.

[ editor.getValue() ]
window.codeValue = editor.getValue(); window.progexType= "recursion"; window.summexName= "recWNumOfPathsPROG"; //return "openPop";