Your friend has sent you a secret message encoded in an unusual way. The message is broken into two lists, each of which seems to just be a random sequence. The first list you will receive is a list of the letters that form the message, and the second list contains the positions of the letters in the secret message. Your job is to combine these lists together to uncover the secret message.
To automate this process, write the function secret, which consumes a list of strings each of length one, los, and a list of positions (or indices) in los, lop. The function should produce a string composed of the list of elements from los which occur at each position given in lop. You can assume that each position in lop is a valid position in los. For example: > (secret (list “5” “1” “c” “!” “s”) (list 2 4 1 1 0 3))
“cs115!”You may use list-ref for this question, but the only allowed string or character function is string-append.Write using racket beginner level and do not use map, filter, lambda and apply in the code.