# You can assume that the function argument, gibberish,

# is a string consisting of nothing but distinct letters

# (a letter can occur twice, once in uppercase, once in

# lowercase).

#

# Returns the set of all strings consisting of letters in

# gibberish, MAINTAINING THE ORDER THEY HAVE in gibberish,

# a vowel in the string either ending the string or being

# followed by a consonant, a consonant in the string either

# ending the string or being followed by a vowel.

#

# Vowels are A, E, I, O, U and their lowercase counterparts.

def f(gibberish):

'''

>>> f('')

{''}

>>> f('A') == {'', 'A'}

True

>>> f('aeio') == {'', 'e', 'a', 'o', 'i'}

True

>>> f('AB') == {'', 'A', 'B', 'AB'}

True

>>> f('ABE') == {'', 'E', 'A', 'B', 'ABE', 'BE', 'AB'}

True

>>> f('AEB') == {'', 'A', 'AB', 'B', 'E', 'EB'}

True

>>> f('bBaA') == {'', 'a', 'ba', 'B', 'A', 'b', 'bA', 'BA', 'Ba'}

True

>>> f('BCADae') == {'', 'CAD', 'BADe', 'e', 'Ca', 'CADe', \

'ADa', 'Ba', 'BADa', 'Ce', 'ADe', 'a', 'Da', 'CA', 'Be', \

'BA', 'C', 'D', 'A', 'CADa', 'AD', 'B', 'BAD', 'De'}

True

'''

# INSERT YOUR CODE HERE

if __name__ == '__main__':

import doctest

doctest.testmod()