Find the letter that comes next in each sequence. See Example 3.
E, I, H, L, K, O, N, . . .
Reference Example 3.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.