Consider the following sequential operating system. We have three machines $($one A machine and two B machines$)$ and two activities $(1$ and $2).$ Activity $1$ can only be done by A in $3$ min, while activity $2$ can be done by each of B machines in $5$ min. The resources and processing times for each activity are given below: $($a$)$ Which resource is the bottleneck? $[5$ pts$]($b$)$ What$$s the capacity of the process $($units$/$minute$)?[5$ pts$]($c$)$ What is the cycle time? $[5$pts$]$