If we can lock a file, we can solve the race condition problem by locking a file during the check-and-use window, because no other process can use the file during the time window. Why don’t we use this approach to solve the race condition problems discussed in this chapter?

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}