Write a code (in any language you feel comfortable with) to create an M/M/1 queue. The arrival rate of the packets to the queue is 5 packets/second. The average service time is 0.1 sec per packet. Run your M/M/1 queueing code for 1 hour. (a) Plot N. versus t where N is the time average of the number of packets in the system. (a) Plot T versus t where Te is the time average of system delay. (b) Show if Little's theorem holds for NT and Tt, where t = 1 hour. Note: Also submit your codes.