Help with Racket homework :c

Define the recursive function (enter s n) that, given a symbol, buries it n number of times. That is, the lists must be nested until the list with the corresponding symbol as the only element is reached. For example:

Transcribed image text