Balance the assembly line shown below for $($a$)$ a shift output of $45$ pieces and $($b$)$ a shift output of $30$ pieces. Assume a nine$-$hour shift, and use the rule: choose the assignable task with the longest processing time. Compute the line efficiency for each case.

Fill in the table below for a shift output of $45$ pieces. Break ties by choosing the lowest task number. If your answer is zero, enter $"0".$ Round your answers to the nearest whole number.