a string consider beautiful satisfie follow conditionsEach 5 english vowel e o u appear itThe letter sort alphabetical order ie es es etcFor example string aeiou aaaaaaeiiiioou consider beautiful uaeio aeoiu aaaeeeooo beautifulGiven string word consist english vowel return length long beautiful substre word if substre exist return 0A substre contiguous sequence character string example 1input word aeiaaioaaaaeiiiiouuuooaauuaeiuoutput 13explanation the long beautiful substre word aaaaeiiiiouuu length 13example 2input word aeeeiiiioooauuuaeiouOutput 5explanation the long beautiful substre word aeiou length 5example 3input word aOutput 0explanation there beautiful substre return 0 Constraints1 wordlength 5 105word consist character e o u