c) Consider the problem of counting in a given text string the number of substrings that start with an A and end with a B. For example, the text string BABDCACB has three such substrings, namely AB, ABDCACB, and ACB. Give the pseudo code for a brute force algorithm which given a string as input will return the number of substrings it contains that start with an A and end with a B