In this problem, we employ the result of Problem 10.6.4 as the basis for a function s=newarrivals(lambda,T) that generates a Poisson arrival process. The program newarrivals.m should do the following:

• Generate a sample value of N, a Poisson (λT) random variable.
• Given N = n, generate {U₁,..., U_n}, a set of n uniform (0, T ) random variables.
• Sort{U₁,..., U_n}from smallest to largest and return the vector of sorted elements.

Write the program newarrivals.m and experiment to find out whether this program is any faster than poissonarrivals.m.