A polynomial $P$ is called [i]level[/i] if it has integer coefficients and satisfies $P\left(0\right)=P\left(2\right)=P\left(5\right)=P\left(6\right)=30$. What is the largest positive integer $d$ such that for any level polynomial $P$, $d$ is a divisor of $P\left(n\right)$ for all integers $n$?

$\text{(A) }1\qquad\text{(B) }2\qquad\text{(C) }3\qquad\text{(D) }6\qquad\text{(E) }10$
1. Given that a polynomial \( P \) is called *level* if it has integer coefficients and satisfies \( P(0) = P(2) = P(5) = P(6) = 30 \). We need to find the largest positive integer \( d \) such that for any level polynomial \( P \), \( d \) is a divisor of \( P(n) \) for all integers \( n \).

2. Consider the polynomial \( P(x) - 30 \). This polynomial has roots at \( x = 0, 2, 5, 6 \). Therefore, we can write:
   \[
   P(x) - 30 = (x-0)(x-2)(x-5)(x-6)Q(x)
   \]
   where \( Q(x) \) is some polynomial with integer coefficients.

3. Thus, the polynomial \( P(x) \) can be expressed as:
   \[
   P(x) = (x-0)(x-2)(x-5)(x-6)Q(x) + 30
   \]

4. To find the largest \( d \) such that \( d \) divides \( P(n) \) for all integers \( n \), we need to evaluate \( P(x) \) at various integer points and find the greatest common divisor (gcd) of these values.

5. Let us evaluate \( P(x) \) at some integer points:
   - For \( x = 1 \):
     \[
     P(1) = 1 \cdot (1-2) \cdot (1-5) \cdot (1-6) \cdot Q(1) + 30 = 1 \cdot (-1) \cdot (-4) \cdot (-5) \cdot Q(1) + 30 = 20Q(1) + 30
     \]
   - For \( x = 3 \):
     \[
     P(3) = 3 \cdot (3-2) \cdot (3-5) \cdot (3-6) \cdot Q(3) + 30 = 3 \cdot 1 \cdot (-2) \cdot (-3) \cdot Q(3) + 30 = 18Q(3) + 30
     \]

6. We need to find the gcd of \( 20Q(1) + 30 \) and \( 18Q(3) + 30 \). Notice that \( Q(x) \) is a polynomial with integer coefficients, so \( Q(1) \) and \( Q(3) \) are integers.

7. Let \( a = Q(1) \) and \( b = Q(3) \). Then we need to find the gcd of \( 20a + 30 \) and \( 18b + 30 \).

8. Consider the gcd:
   \[
   \gcd(20a + 30, 18b + 30)
   \]
   Since \( 30 \) is common in both terms, we can factor it out:
   \[
   \gcd(20a + 30, 18b + 30) = \gcd(20a + 30 - (18b + 30), 18b + 30) = \gcd(20a - 18b, 30)
   \]

9. Simplify \( 20a - 18b \):
   \[
   20a - 18b = 2(10a - 9b)
   \]
   Therefore:
   \[
   \gcd(20a - 18b, 30) = \gcd(2(10a - 9b), 30) = 2 \cdot \gcd(10a - 9b, 15)
   \]

10. Since \( 10a - 9b \) is an integer, the gcd of any integer with 15 is at most 15. However, since \( 10a - 9b \) can be any integer, the gcd of \( 10a - 9b \) and 15 can be 1, 3, 5, or 15. The smallest non-trivial gcd is 1, so:
    \[
    \gcd(10a - 9b, 15) = 1
    \]

11. Therefore:
    \[
    \gcd(2(10a - 9b), 30) = 2 \cdot 1 = 2
    \]

12. Hence, the largest positive integer \( d \) such that \( d \) is a divisor of \( P(n) \) for all integers \( n \) is \( \boxed{2} \).