QUESTION $16$

The

problem finds a path through a graph that traverses each edge once.

a$.$ konigsberg bridge problem

b$.$ knapsack problem

c$.$ traveling salesman problem

d$.$ convex hull

QUESTION $17$

The

problem finds a path through a graph that visits each vertex once.

a$.$ konigsberg bridge problem

b$.$ knapsack problem

c$.$ traveling salesman problem

d$.$ convex hull

QUESTION $18$

The tower of hanoi problem requires

a$.2n-1$

b$.n!$

c$.2^n-1$

d$.nlogn$

steps to move $n$ disks.

steps to move n disks.