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 $1$ The essence of your solution to the challenge in a single paragraph.

Section $2$ An explanation of the original algorithms of your solution in non$-$technical language.

You do not need to describe the workings of any standard algorithm, such as mergesort, that

might comprise part of your solution.

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.

Section $4$ A list of the data structures in your solution. Explain why each chosen data structure is

suitable for the task.

Section $5$ A javascript implementation of your solution and a link to a one minute video that

shows your code in execution. The source code must be visible and your code must be

commented in order to facilitate cross$-$checking with your pseudocode.

Section $6$ Point out any defects of your design and$/$or implementation. Suggest remedies for

these shortcomings.

Submit your report as a pdf$.$ Pay attention to clarity of expression, document presentation, and

pseudocode and code formatting. Handwritten answers are prohibited.