Recurrance relation question


#1

Let wn denote the number of all possible words of length n, on the alphabet {“H”, “E”, “L”, “O”}, which do not contain the substrings “HELL” and “LEH”. find the recurrance relation satisfied by wn