# Recursive Set

Need a Solution to the following question

Let ? be the alphabet defined as follows: ? = {e, l, v}
We now deifine the set of strings P according to the following:
BASIS STEP: If x ? ? then x ? P
RECURSIVE STEP: If ? ? P and x ? ?, then x?x ? P
Show that the string level is in P

• Thanks for replying Please provide full answers, and please solve them in a way that a someone who semi-understands (me) can comprehend and study it in the future.

Answers can be viewed only if
1. The questioner was satisfied and accepted the answer, or
2. The answer was disputed, but the judge evaluated it as 100% correct.