Consider a red gateway with maxp = 0.01, and with an average queue length halfway between the two thresholds.
(a) find the drop probability pcount for count = 1 and count = 100.
(b) calculate the probability that none of the first 50 packets is dropped. note that this is (1 − p1) × ··· × (1 − p50).

Write a program that prints the day number of the year, given the date in the form month-day-year. for example, if the input is 1-1-2006, the day number is 1; if the input is 12-25-2006, the day number is 359. the program should check for a leap year. a year is a leap year if it is divisible by 4, but not divisible by 100. for example, 1992 and 2008 are divisible by 4, but not by 100. a year that is divisible by 100 is a leap year if it is also divisible by 400. for example, 1600 and 2000 are divisible by 400. however, 1800 is not a leap year because 1800 is not divisible by 400.