Assume a file contains the following characters with the associatedfrequencies displayed in the
table:
a b c d e f g
9 11 6 4 24 12 16
1. how many bits are necessary to store the characters in a fileusing fixed length codes?
2. show the code built using the huffman algorithm
3. how many bits are necessary to store the characters using theprefix code returned by the
huffman algorithm?
4. assume all the characters have the same frequency (say 10). showthe tree built by the huffman
algorithm in that case, and determine the associated number ofbits

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.