Use Psuedocode:

Algorithm Design: Recursive Divide & Conquer

Turn the recursive divide & conquer strategy below to compute the total number of occurrences of a given character in a string of length zero or more represented as a character array into a recursive divide & conquer algorithm. The algorithms header is provided; complete the rest.

The number of occurrences of character X in string S is the sum of the number of occurrences of character X in the left half of string S and the number of occurrences of character X in the right half of string S

Character-Count-Recursive(S: array [p..r] of char, X: char)