AMC 10A 2026 (Problem 18)

The strictly decreasing sequence of 11 positive integers (a0,a1,a2,…,a10)(a_0,a_1,a_2,\ldots,a_{10}) is defined by the recursive rule ak=12ak−1+2a_k=\frac{1}{2}a_{k-1}+2, for k≥1k\ge 1. Let NN be the minimum possible value of a0a_0. What is the sum of the digits of NN?
(A)  8\text{(A)}\;8(B)  9\text{(B)}\;9(C)  10\text{(C)}\;10(D)  11\text{(D)}\;11(E)  12\text{(E)}\;12