Using the data in Table 8-1, show what happens if the throughput of the computing suite is only doubled instead of quadrupled, specifically, how many of the 5 tasks can now execute.

Table 8.1 Example of rate monotonic scheduling Task Execution time, E Period, T Deadline Utilization 1 0.1 S 0.2 S 180 ns 0.5 2 0.15 S 0.5 PS 0.45 S 0.3 3 0.2 us 1.0 US 1.0 S 0.2 4 0.3 S 2.0 S 1.8 S 0.15 5 5 0.5 S 3.0 S 2.5 S 0.17 Importance, C Priority, P 10 50 8 16 5 5 2 1 1 1 0.3 Table 8.2 Maximum resource utilization Maximum # Tasks utilization 1 1 1 2 0.828 3 0.780 4 0.757 5 0.743 Table 8.1 Example of rate monotonic scheduling Task Execution time, E Period, T Deadline Utilization 1 0.1 S 0.2 S 180 ns 0.5 2 0.15 S 0.5 PS 0.45 S 0.3 3 0.2 us 1.0 US 1.0 S 0.2 4 0.3 S 2.0 S 1.8 S 0.15 5 5 0.5 S 3.0 S 2.5 S 0.17 Importance, C Priority, P 10 50 8 16 5 5 2 1 1 1 0.3 Table 8.2 Maximum resource utilization Maximum # Tasks utilization 1 1 1 2 0.828 3 0.780 4 0.757 5 0.743