Find solutions for a fractional Knap Sack problem which uses the criteria of maximizing the profit per unit capacity at each step, with: n= 4, M=5, pi=13, p=20,p;= 14, pe=15 wi= 1, w2=2, w3=4, w=3 where n is the number of objects, p is the profit, w is the weight of each object and M is the knapsack weight capacity. Show detailed calculations of how the objects are chosen in order, not just the final solution.