$1.$Outline an algorithm that can quickly find a candidate clique on par with how nearest neighbor finds a quick path for Travelling sales man problem.

It does not need to be the maximum clique but it should be a good candidate.

$2.$Bellman$-$Ford is a classic Algorithm, however, it does not always terminate. So we run the loop for O$($n$)$ iterations to see if it terminates.

What have you learned if it fails to terminate.

$3.$Show how to reduce a problem of your choice to a $3$SAT