Code Challenge: Assume that the variable word has already been defined with an arbitrary str value.

word $=???$

The i$-$th rotation of a string is the result of shifting every character of the string i positions to the right, with characters at the end wrapping around to the beginning. For example, the $2$nd rotation of the string "Burrow" is "owBurr". For any given string, the $0-$th rotation is simply itself.

Print every rotation of word, one rotation per line, starting with the $0-$th rotation, then the $1$st rotation, then the $2$nd rotation, etc.

Example: If word $=$ "Burrow", you would print the following:

Burrow

wBurro

owBurr

rowBur

rrowBu

urrowB