There are many aspects to a poem and a poetry assistant could help a poet in various ways, but a basic requirement is that an assistant should suggest rhymes. For example, on submission of cat, the assistant would return a list of rhymes: $>$ cat? $>$ acrobat, bureaucrat, laundromat, thermostat This coursework asks you to design and implement such an assistant. Your design must contain at least one original algorithm and at least one data structure. A minimum requirement is that your poetry assistant should deliver rhymes. Your response to this challenge will be in the form of a report which should consist of the following sections:

Section $3$ Pseudocode for each original algorithm. You are urged to follow the pseudocode conventions of Cormen at al$,$ Chapter $2.$ Pay great attention to how you lay out your pseudocode. In particular, take care to use structured indentation. Pseudocode that is not correctly indented, or is otherwise unreadable, will not be marked.

Using Pseudocode for each original algorithm $($in structured indentation$)$

$($e$.$g$.$ IF$-$ENDIF, FOR$-$ENDFOR$)$