Task 2 Files 1 task2 solution.py * # you can write to stdout for debugging purposes, e.g. 2 # print("this is a debug message") 3 4 def solution (S): 5 solution.py test-input.txt You are given a string S consisting of letters 'a' and 'b'. You want to split it into three separate non-empty parts. The lengths of the parts can differ from one another In how many ways can you split Sinto three parts, such that each part contains the same number of letters 'a'? Write a function: 6 def solution (S) that, given a string S of length N, returns the number of possible ways of splitting S as described above. Examples: 1. Given S = "babaa", the function should return 2. The possible splits are: "ba | ba| a" and "bab |a|a". 2. Given S = "ababa", the function should return 4. The possible splits are: "a baba", "a | bab | a", "ab |a|ba" and "ab | abla". 3. Given S = "aba", the function should return 0. It is impossible to split S as required. 4. Given S = "bbbbb", the function should return 6. The possible splits are: "b1bbbb", "b | bb | bb", "bbbbb", "bb | b | bb", "bb | bbb" and "bbb|b| b". Each part contains the same number of letters 'a', i.e. O. Write an efficient algorithm for the following assumptions: Nis an integer within the range (1..40,000); string S contains only letters 'a' and 'b