7. Describe an algorithm that takes two strings, A and B, and returns the number of occurrences of every character in A that appears in B. Let n = Lena + LenB. The runtime of your algorithm must be O(n). You may treat strings as arrays of characters. That is, you can iterate over a string, and access the character at a given index