$1.$ n numbers can be summed using n processors in $($a$)$ Constant time. $($b$)$ O$($loglogn$)$ time. $($c$)$ O$($logn$)$ time. $($d$)$ O$($n$)$ time. $2.$ n numbers can be summed using n $2$ processors in $($a$)$ Constant time. $($b$)$ O$($loglogn$)$ time. $($c$)$ O$($logn$)$ time. $($d$)$ O$($n$)$ time. $3.$ n numbers can be summed using n$/$logn processors in $($a$)$ Constant time. $($b$)$ O$($loglogn$)$ time. $($c$)$ O$($logn$)$ time. $($d$)$ O$($n$)$ time. $4.$ n numbers can be summed using n$/$log $2$ n processors in $($a$)$ Constant time. $($b$)$ O$($loglogn$)$ time. $($c$)$ O$($logn$)$ time. $($d$)$ O$($n$)$ time. $($e$)$ O$($log $2$ n$)$ time. n numbers to be summed using p $<=$ n processors: $5.$ n numbers need to be divided into $($a$)1$ group. $($b$)$ n groups. $($c$)$ p groups. $($d$)$ n