Question $5$

For a knapsack problem with $n$ items, what is the running time of the exhaustive search solution algorithm?

$O(n*2^n)$

$O(2^n)$

$O(n!)$

$O(n^n)$