  We prove that the Weihrauch degree of the problem of finding a bad sequence
in a non-well quasi order ($\mathsf{BS}$) is strictly above that of finding a
descending sequence in an ill-founded linear order ($\mathsf{DS}$). This
corrects our mistaken claim in arXiv:2010.03840, which stated that they are
Weihrauch equivalent. We prove that K\"onig's lemma $\mathsf{KL}$ and the
problem $\mathsf{wList}_{2^{\mathbb{N}},\leq\omega}$ of enumerating a given
non-empty countable closed subset of $2^\mathbb{N}$ are not Weihrauch reducible
to $\mathsf{DS}$ either, resolving two main open questions raised in
arXiv:2010.03840.
