a$)$ Let $$ and $$ be alphabets. What does it mean that a Turing machine computes

a function $f$:${}^{**}{}^{**}?$ b$)$ What does it mean that a function is computable in

polynomial time? c$)$ Give the definition of polynomial time reducibility.

a$)$ What is the Travelling Salesman Problem? b$)$ Define the formal language TSP$.$

c$)$ State the complexity theorem we have learnt on TSP$.$ d$)$ If $($:$G,17$:$)inTSP$ then

$($:$G$:$)$ belongs to what language?