2. [20 points] You receive a set A of w words to use in a word list to be used by your cool spell checker. You also get an n word document D. Your boss wants your code to list all the words in D that are not in A. Give an O(n + w) expected time algorithm in pseudocode that only requires space for at most 2w references (plus the space needed to store the words in A and the words in the document). You can consider a word comparison ( ) to be an elementary op. This is NOT C++ code!!! As a hint, O(m+n) normally implies two consecutive loops. Think through the problem! Do not assume anything about A or D