Problem2-1: 1.12 

Problem2-2: Implement one of 1.7, 1.9 or 1.10 from the text.

Problem2-3:

   Do problem 1.24 from the text.  Run with n = 100, 200, 300, ... 10,000.
   Plot values for d-hat, q-hat, and u-hat.

Problem2-4: Implement Matlab version of single server queue

Problem2-5: Implement Matlab version of inventory system

Problem2-6: Run both C and Matlab versions of the inventory system 100 times
            to get better estimates and compare results.

Problem2-7: 

  GRADS ONLY: 

   Get accounts on one of: 

    college Beowulf system 
    CHPC Beowulf system 
    CHPC SGI O2k 
    CHPC SP-2.