In this task, you are given two strings A,B. You must perform the following operations to generate the required output list: (i) Find the longest common substring in the strings A and B, (ii) Convert this substring to all lowercase and sort it alphabetically, (iii) Replace the substring at its respective positions in the two lists with the updated substring.
One example: bYubMFxyTqR, AcDbMFxSnI
Solution is here: bYubfmxyTqR, AcDbfmxSnI
Explanation: Here, 'bMFx' is the longest common substring in both the input strings 'bYubMFxyTqR' and 'AcDbMFxSnI'. Sorting it and converting to lowercase gives 'bfmx'. Replacing 'bfmx' instead of 'bMFx' in the two strings gives 'bYubfmxyTqR' and 'AcDbfmxSnI'

Now, solve this: aowzbybFtCkuzVpQzqwWStVJZtDtfbswsVvJ, jWQrwOEtUdXXIIhZypQzqwWStVJZtDtfbswEIGUXZgVVWIzE
Solution:
aowzbybFtCkuzVbdfjpqqsstttvwwwzzsVvJ, jWQrwOEtUdXXIIhZybdfjpqqsstttvwwwzzEIGUXZgVVWIzE