The trivial languages $$are Prove the following claim:$\backslash$Phi and $$

If NP$!=$coNP, then there are two non$-$trivial languages $$A and B in the class NP$\backslash$cup coNP, so there is no reduction

in polynomial time from A to B$,$ and there is no reduction in polynomial time from B to A$.($Neither A$<=\backslash$rho B nor B$<=\backslash$rho A$.)$