Loading a Truck - Greedy algorithm You are given an array, weights, that contains the weights of some cargo items in pounds. You want to load a truck with items from the list. up to its capacity. The truck has a maximum capacity of 1,000 pounds For this problem use a "greedy algorithm. That is always load the heaviest item that will still fit on the truck Keep loading until the remaining capcity of the truck is less than any of the remaining cargo items. For example, if the weights were [250, 400, 700, 100, 60), you would load the 700-pound item, then the 250-pound item. The remaining items would be too heavy to fit on the truck In this problem, use the built-in function sort() to sort the weights in descending order, which simplifies the algorithm. The weights will be generated randomly, so you cannot hard-code the answer - you must write a general algorithm to do it Once the loading is complete, print a message indicating how many pounds of cargo were loaded onto the truck. NOTE: To satisfy the auto-grader, update the variable capacity so that it contains the remaining capacity of the truck. For example, if 943 pounds of cargo are loaded, capacity should be 57 Script Reset MATLAB Documentation 1 The weights of the cargo items are generated at random weights - randi(500, 1, randi(18)) capacity - 1000; Xcargo capacity of the truck