Consider the problem of counting, in a given text of upper-case letters, the number of substrings that start with an A and end with a B.

(a) Design a brute-force algorithm for this problem.

(b) Determine the efficiency class (using the worst case) for your algorithm.

(c) Implement your algorithm in Java. Your program should prompt the user for an input string of upper-case letters and output the number of substrings that start with an A and end with a B. Hint: Use charAt(i).

Input: A string of upper-case letters, e.g., CABAAXBYA.

Output:There are four substrings in the given text that start with A and end with B.

Sample I/O:

You will also be required to do a demonstration run of your program with a sample data set in class.

Configuration: CSCE2110Asgn4 - JDK version Enter the input string in upper-case letters: CABAAXBYA Number of A..B substrings4