Consider the following descriptive complexity measure:

$K_{350}(x)=mi{n}_{M(y)}=x|Q|+|y|$

That is$,$ the minimum over all pairs of a standard TM $M$ and a string $y$ such that $M$ outputs $x$ on input $y,$ of the number of states of $M$ plus the number of characters of $y.$

Prove that