Python task from edX...again
<p>This is the second time I will ask you for help regarding a task from the MIT edX class.</p>

<p>The task is:
A word is considered erician if it contains the letters e, r, i, and c in it, in that order. For example, we would say that the following words are erician: "meritocracy", "generic", "derrick", "euphoric", "heretic", and "electric", because they each contain those four letters in the correct order. The word "rice" is not erician because the four letters appear in the wrong order.</p>

<p>In this problem, we want you to write a more generalized function called x_ian(x, word) that returns True if all the letters of x are contained in word in the same order as they appear in x.</p>

<p><em><strong>This function has to be recursive! You may not use loops (for or while) to solve this problem.</em></strong></p>

<p>And here is my code for the function:</p>

<pre><code>if x=="":
        return True
if len(x)&gt;len(word):
        return False
if x==word:
    return True
elif (x[0]==word[0]):
    x_ian(x[1:],word[1:])
else:
    x_ian(x,word[1:])
</code></pre>

<p>I am currently at a loss why my function returns None, not True or False. I have worked with the debugger in IDLE on this and it finishes the execution with 
' main '.x_ian().line49: return True</p>

<p>Yet the function returns None. </p>

<p>Will appreciate any help.</p>
