Could you please fix this python code?

I tried to fix this but it didn't worked.

Problem 2. Implement the functions zeros ) and ones) inbits.py that takes a bit string (i.e., a string of zeros and ones) s as argument and returns the number of zeros and ones in s, each computed recursively. The number of zeros in a bit string is 1 or 0 (if the first character is 'o or '1') plus the number of zeros in the rest of the string; number of zeros of an empty string is 0 (base case). The number of ones in a bit string can be defined analogously. gapython bi tongy 10100 0210911010111 zeros-11, ones- 14, total-25