Searching for the number of substrings in a given text that start with the letter A and end with the letter B. For example, in the DABAAKBSA text, there are 4 substrings that begin with the letter A and end with the letter B. a) Design a brute-force algorithm that performs the desired operation above and implement it in c language. Let the searched text be entered by the user.

b) Calculate the time complexity of the algorithm you designed.

c) Design an algorithm that is more efficient than the brute-force algorithm and implement it in c language. Let the searched text be entered by the user.

d) Calculate the time complexity of the algorithm you designed and compare it with the brute-force algorithm.