you give string word1 word2 you want construct string merge follow way word1 word2 nonempty choose follow optionsif word1 nonempty append character word1 merge delete word1For example word1 abc merge dv choose operation word1 bc merge dvaif word2 nonempty append character word2 merge delete word2For example word2 abc merge choose operation word2 bc merge aReturn lexicographically large merge constructa stre lexicographically large string b length position b differ character strictly large corresponding character b for example abcd lexicographically large abcc position differ fourth character d great c example 1input word1 cabaa word2 bcaaaoutput cbcabaaaaaexplanation one way lexicographically large merge take word1 merge c word1 abaa word2 bcaaa take word2 merge cb word1 abaa word2 caaa take word2 merge cbc word1 abaa word2 aaa take word1 merge cbca word1 baa word2 aaa take word1 merge cbcab word1 aa word2 aaa Append remain 5 word1 word2 end mergeexample 2input word1 abcabc word2 abdcabaoutput abdcabcabcaba constraints1 word1length word2length 3000word1 word2 consist lowercase english letter