Create an algorithm which takes as input a string s (a null-character terminated character array), a character c, and an integer i, and it returns the number of times that c occurs in s to the right of position i.
moreover, the algorithm which computes this total must be recursive.
how would you then use this algorithm to determine the number of times a letter c occurs in an entire string s?
note: if can't write an alogorithm for this, write it in c++