Given a language L, let first(L) be the following language {r | Eye * such that zy L}. Show that if L is Turing recognizable, then first(L) is Turing recognizable. Given a language L, let first(L) be the following language {r | Eye * such that zy L}. Show that if L is Turing recognizable, then first(L) is Turing recognizable