PLEASE ANSWER ASAP!!!

1. (60 pts.) Imagine a thief entering a house. In the house, there are infinitely many items that can have only one of three different weights: 1 kg, 3 kgs, and 5 kgs. All of the items are discrete. The thief has a bag capacity of a kgs and strangely, he wants to steal the smallest number of items (d) (5 pts.) Show that the greedy choice of taking the largest weight items into the bag first fails to lead to an optimal solution