Use the heuristic algorithm discussed in the class about the Line-of-Balance problem to solve the following specific problem (until the first three stations can no longer accommodate any more tasks), where (1) the precedence relationships are summarized in Figure 1 below, ii) the Average Performance Times are also given in Table 1 and (iii) the cycle time c is set to be 11 units of time. Implement the algorithm exactly as it is specified in the class materials until the first three stations can no longer accommodate any more tasks. There is NO NEED to solve the entire problem.

Use this set of notation: N; A; T; S. 4 8 TO Fig. 1. Precedence graph. Table 1: Average Performance Times. Task Number Average Performance Time 6 6 3 5 U UI AU 6 IN 10