Given a character string X of length n, describe an O(n)-time algorithm to construct the set, C, of distinct characters that appear in C, along with a count, f(c), for each c in C, of how many times the character c appears in X. You may assume that the characters in X are encoded using a standard character indexing scheme, like the ASCII system.