is regularish when all the words in each sublist have the
length of this sublist.
Design a function es_regulin(llpals) which, given a list
of wordlists llpals, returns True when llpals
is regularish.
About statements
The official statement of a problem is always the one
in the PDF document. The HTML version of the statement
is also given to help you, but may contain some content
that is not well displayed. In case of doubt, always use the PDF.