Extra Problem (4 pts.): Define recursively the function ONE defined on binary strings, that for a given string w, ONE(W) is equal to the number of occurrences of the character 1 in w. For instance ONE(10010) = 2, ONE(00000) = 0, ONE(11111) = 5