What is the algorithm method used in the code below, please explain? Examine it for complexity.

def knapsack/W, wt, val, n): dp = [O for i in range/W+1)] fori in range(1, n+1): for w in range/W, 0, -1); if wt[i-1]