Past exam of the computer science course of the University of Oxford / 2019 / Computational game theory / 1 / c

Yes to both questions, for both players. Site one is strictly dominated by site two. Against opposing site $y$, the payoff difference isEvery difference is positive for $k\ge 4$. By reflection, site $k$ is strictly dominated by site $k-1$. These endpoint actions are therefore also weakly dominated strategies, since strict dominance is stronger than the requirement of being no worse everywhere and better somewhere.