Refer the image and solve all $2$ questions

$4.$Which of the following statements are known to be true, if there is a polynomial$-$time algorithm for Unique$--$SAT?

$NP=P.$

$NP=RP.$

$NP=FP.$

None of the above.

$5.$Which of the following problems are known to be in complexity class BPP$?$

Graph Isomorphism.

Traveling Salesmen Problem.

Primality Testing

Factoring