In what concerns the continuous evaluation solving exercises grade during the semester, you should submit until 23:59 of December 7th
(this exercise will still be available for submission after that deadline, but without counting towards your grade)
[to understand the context of this problem, you should read the class #08 exercise sheet]

In this problem you should submit a function as described. Inside the function do not print anything that was not asked!

[IP075] Ancient Texts

Samwell Tarly, the learned scholar from the Night's Watch, is studying ancient texts written in various cases. He has a list of words and wants to analyze them to gain insights about the writing styles of different authors. Specifically, Samwell is interested in counting how many words in the list are written on lowercase, uppercase or none.

The Problem

Write a function word_types(lst) that given a list of strings lst returns a tuple (lower,upper,other) where:

• lower is the number of words written only in lower case (e.g., "winter", "snow").
• upper is the number of words written only in upper case (e.g., "WALL", "CASTLE").
• other is the number of words that contain a mix of lowercase and uppercase letters (e.g., "KingsLanding", "TheSevenKingdoms").

Constraints

The following limits are guaranteed in all the test cases that will be given to your program:

You can also be assured that the length of each word will be at most 50 and that all words will be made only of letters (no other type of characters will appear).

print(word_types(["Winter","IS","coming","WALL","CASTLE"]))
print(word_types(["stark","Lannister","TaRgArYeN", "ARRYN","tully"]))
print(word_types(["Robb", "Sansa", "Arya", "Bran", "Rickon", "Jon"]))

(1, 3, 1)
(2, 1, 2)
(0, 0, 6)