Erician words

For some reason I really liked this small problem from PSET5 from MITx 6.00x.

Here is the problem definition:

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.

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.

This algorithm works merging the two strings together and comparing character by character to determine if "x" is contained within "word".

First of all, sorry for my bad english I'm not a native speaker but I hope you can understand this solution.

Sobre bloqueo de celulares y el libre mercado

Desde hace algunos días, se ha venido caldeando la discusión referente a la aprobación de una ley que obligue a las operadoras de servicios de telefonía celular vender los aparatos celulares desbloqueados, es decir, que puedan utilizarse con “chips” de cualquier compañía.

Es difícil entender este tema sin entrar en muchos detalles técnicos, sin embargo hare algún intento por explicar como realmente los problemas que se mencionan para oponerse a esta ley se quedan pequeños comparados a las ganancias que obtendremos, en este caso un mercado muchísimo más competitivo.