Kyle found the sum of the digits of $2014^{2014}$. Then, Shannon found the sum of the digits of Kyle's result. Finally, James found the sum of the digits of Shannon's result. What number did James find?

$\text{(A) }5\qquad\text{(B) }7\qquad\text{(C) }11\qquad\text{(D) }16\qquad\text{(E) }18$
1. **Understanding the problem**: We need to find the sum of the digits of \(2014^{2014}\), then the sum of the digits of that result, and finally the sum of the digits of the second result. We are asked to find the final number James found.

2. **Using properties of digits and modulo 9**: A number is congruent to the sum of its digits modulo 9. This property will help us simplify the problem significantly.

3. **Calculating \(2014^{2014} \mod 9\)**:
   \[
   2014 \equiv 2 + 0 + 1 + 4 = 7 \pmod{9}
   \]
   Therefore,
   \[
   2014 \equiv 7 \pmod{9}
   \]
   So,
   \[
   2014^{2014} \equiv 7^{2014} \pmod{9}
   \]

4. **Simplifying \(7^{2014} \mod 9\)**: We need to find the pattern in the powers of 7 modulo 9.
   \[
   7^1 \equiv 7 \pmod{9}
   \]
   \[
   7^2 \equiv 49 \equiv 4 \pmod{9}
   \]
   \[
   7^3 \equiv 7 \cdot 4 = 28 \equiv 1 \pmod{9}
   \]
   We see that \(7^3 \equiv 1 \pmod{9}\). Therefore,
   \[
   7^{2014} = (7^3)^{671} \cdot 7^1 \equiv 1^{671} \cdot 7 \equiv 7 \pmod{9}
   \]

5. **Interpreting the result**: Since \(2014^{2014} \equiv 7 \pmod{9}\), the sum of the digits of \(2014^{2014}\) is congruent to 7 modulo 9. 

6. **Finding an upper bound**: We need to ensure that the sum of the digits of \(2014^{2014}\) and subsequent sums are within reasonable bounds.
   \[
   2014 < 10^4
   \]
   Therefore,
   \[
   2014^{2014} < (10^4)^{2014} = 10^{8056}
   \]
   The maximum sum of the digits of a number less than \(10^{8056}\) is \(9 \times 8056 = 72504\).

7. **Sum of digits of \(2014^{2014}\)**: The maximum sum of digits of \(2014^{2014}\) is 72504. The sum of the digits of 72504 is:
   \[
   7 + 2 + 5 + 0 + 4 = 18
   \]

8. **Sum of digits of 18**: The sum of the digits of 18 is:
   \[
   1 + 8 = 9
   \]

9. **Conclusion**: The sum of the digits of \(2014^{2014}\) modulo 9 is 7, and the sum of the digits of the result is less than or equal to 12. The only number that satisfies both conditions is 7.

The final answer is \(\boxed{7}\)