Given five memory partitions of 120 kb, 380 kb, 410 kb, 232 kb, and 540 kb (in order), how would each of the first-fit, best-fit, and worst-fit algorithms place processes of 215 kb, 425 kb, 112 kb, and 328 kb (in order)? which algorithm makes the most efficient use of memory?

The letters a, e, i, o and u are the only vowels. write a function named vowelusedict() takes a string t as a parameter and computes and returns a dictionary with the number of words in t containing each vowel. assume that the given text contains only lower case letters and white space. input: t, a string consisting of lower case letters and white space return: a dictionary in which each vowel is a key and its value is the number of words containing that vowel for example, the following would be correct output. text = 'like a vision she dances across the porch as the radio plays' print(vowelusedict(text)) {'e': 5, 'u': 0, 'o': 4, 'a': 6, 'i': 3}