Constrained Chopping

Alice and Bob are playing a game with an array $A$ of $N$ integers. The rules of the game are as follows: - Let $|A|$ denote the current length of $A$. - If $|A| \le 2$, the game terminates immediately. Otherwise, Alice must choose an index $i$ such that $1 < i < |A|$. - Then, Bob must choose **one** of the following two actions: 1. Delete all elements at indices $1, 2, \dots, i$. 2. D