Given two strings, one is a subsequence if all of the elements of the string occur in the same order within the other string(not necessarily contiguous).
For e.g. 'I programming' is a subsequence of 'I like programming'
In this challenge, given two strings s and t, find out the longest common subsequence of s in t and report the words missing from s in the order they are missing.