(a)

Compute probability the wait time for a Bundle is at most 1 hr:

P[X1]=012e2xdx[e2t]|010.8647

(b)

Erlang distribution:

fY(y)=λ(1)!y1eλy,y0

Desired probability:

P[Y1]=011054!y4e10ydy0.9707

This integral requires iterated IBP.


(c)

The results disagree. Method 2 is the correct approach assuming individual calls arrive according to a Poisson process.

It turns out that if you have some Poisson process, bundles of arrivals do not themselves follow a Poisson process.

Think of a Poisson process as some dots scattered on a timeline. Place a heavy dot at the location of each 5th dot in order, and erase all other dots. These heavy dots do not follow a Poisson process.