The processing sequences and processing times of two products produced in an enterprise in five stalls are given in the following table. Find the production sequence that will minimize the maximum completion time with the Aker algorithm. What are the times when the products start production on the counters and are completed? Show the result with Gantt chart and table (chart).

Product 1 Sequence of action A B C D E
Processing time (hours) 5 4 3 6 3
Product 2 Sequence of action B C A D E
Processing time (hours) 6 4 5 3 6