can someone please help me with this and explain in detail please?

Design an algorithm that takes a sequence of N document words and a sequence of M query words and find the shortest interval in which the Mquery words appear in the document in the order given. An 'interval' corresponds here to a contiguous sequence of words; it's size is the number of words that it contains. Give the algorithm m hould run in linearthmic tme prose or pseudocode. It sl