Scheme/Dr.Racket Help

Using Scheme/DrRacket for this problem:

I need help /g/...

This problem is telling me to do the following:

Create a Scheme function has-consequence? that consumes word (a string with one or more lower-case letters). It produces true if all the letters in word appear in the word “consequence", and false otherwise.



I understand that I have to use recursion and lists for this. So far all I've been able to do is convert the word that I'm supposed to use as a list by doing the following:

string->list "consequence"



However, how do I make the program convert the argument "word" into a list and then compare "consequence" with "word" to see if all characters in the "word" appear in "consequence"?

>>17
So you were there to witness it.