Problem: Google search engine. Y. R. searches for tom and jerry by typing in Google's textbox TOM JERRY. Y.R. is interested in finding all the documents that contain both TOM and JERRY. The engine returns a sorted sequence T of document numbers (IDs), i.e. all documents containing the word TOM and a sorted sequence J of document numbers (IDs) containing the word JERRY. The length (number of documents) of T is √ n and the length or J is n. You need to generate the output C that contains all the document numbers that contain both TOM and JERRY; no duplicates, not necessarily sorted. How much space and time does Y.R. need to determine the answer C using a space and time efficient algorithm that would determine all the documents containing both keywords TOM, JERRY? Explain.