Considering a 0/1 Knapsack problem, explain the application of Dynamic Programming, Backtracking and Greedy algorithm to found an optimal solution. Give the three separate representation of problem space and compare the time complexity of the algorithms under the said paradigm.