These songs tend to last a long time, despite having relatively short scripts. in particular, you can convey the words plus instructions for one of these songs by specifying just the new line that is added in each verse, without having to write out all the previous lines each time. (so the phrase "five golden rings" only has to be written once, even though it will appear in verses five and onward.) there's something asymptotic that can be analyzed here. suppose, for concreteness, that each line has a length that is bounded by a constant c, and suppose that the song, when sung out loud, runs for n words total. show how to encode such a song using a script that has length f (n), for a function f (n) that grows as slowly as possible.