Show that there exists a polynomial $p(*)$ such that, given

$($i$).$ a two$-$player game $(R,C{)}_{nn},$ where the entries of $(R,C)$ are rational numbers of bit complexity $b$;

$($ii$).$ a $\frac{1}{2^{p(n*b)}}-$Nash equilibrium of $(R,C),$

there exists a polynomial time algorithm that computes an exact Nash equilibrium of $(R,C).$ Recall

that a rational number has bit complexity $b$ if the number can be represented using $b$ bits. $(15$ points$)$