[A.I. - Simulated Annealing] Truck Loading Problem -- Explain why this approach to loading is not guaranteed to always find the optimal solution by providing a counter example showing that this heuristic can lead to suboptimal solutions.

In the activity from Lecture 7 and towards the end of Lecture 8, we discussed a way to solve the truck loading problem using Simulated Annealing. In question 3 of the activity, we were asked to come up with a better heuristic than the programmer's heuristic, which was to load the metal parts in the order they appeared on the list. We proposed the following heuristic: first sort the metal parts by weight in descending order. Next, start loading items into the first truck, let's call it T1. If we come across an item that won't fit, we add it to a second truck, called T2. We would keep trying to add items to the first trucks T1, T2, etc. before adding any parts on new trucks. Whenever we would find an item that would not fit on any of the current trucks, we would then add it to a new truck. This heuristic is not optimal. Explain why this approach to loading is not guaranteed to always find the optimal solution by providing a counter example showing that this heuristic can lead to suboptimal solutions. In the activity from Lecture 7 and towards the end of Lecture 8, we discussed a way to solve the truck loading problem using Simulated Annealing. In question 3 of the activity, we were asked to come up with a better heuristic than the programmer's heuristic, which was to load the metal parts in the order they appeared on the list. We proposed the following heuristic: first sort the metal parts by weight in descending order. Next, start loading items into the first truck, let's call it T1. If we come across an item that won't fit, we add it to a second truck, called T2. We would keep trying to add items to the first trucks T1, T2, etc. before adding any parts on new trucks. Whenever we would find an item that would not fit on any of the current trucks, we would then add it to a new truck. This heuristic is not optimal. Explain why this approach to loading is not guaranteed to always find the optimal solution by providing a counter example showing that this heuristic can lead to suboptimal solutions