Can someone please help me with this I am having trouble with solving these questions

#1. Using the exhaustive search algorithm for the Traveling Salesman Problem, How many paths (i.e., tours) would have to be evaluated if we have 12 cities? How many paths (i.e., tours) would have to be evaluated if we have 24 cities? #2. Solve the Knapsack Problem for a knapsack with a capacity of 12 pounds and the following four items to carry: Item 1 weighs 8 pounds and is valued at $43. Item 2 weighs 4 pounds and is valued at $14. Item 3 weighs 5 pounds and is valued at $41. Item 4 weighs 6 pounds and is valued at $26