Incorrect Question 2 0/2 pts To find the optimal solution for 0-1 knapsack, what would be dimensions of the extra array that we would need? The knapsack has a capacity of W, and there are total of n items. Assume we are using the approach that was discussed in the exploration. Array[n+1] Array[W+1] [n+1] Array[W][n] Array[W]