(12 points) given a character string x of length n, describe and pseudocode o(n)-time algorithm to construct the set, c, of distinct characters that appear in c, along with the 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.