Consider the problem of counting, in a given text, the number of substrings that start with an `A` and end with a `B`. For example, there are four such substrings in `CABAAXBYA`. Design a brute-force algorithm for this problem and determine its efficiency class [in pseudo code!].