[Solved]Write C Program Print Calendar Ask User Year Display Display Calendar 12 Months Code Kee Q37244755

Write a C++ program to print out calendar. Ask the user which year to display. . Display the calendar for 12 months. . The code keeps on running until the user ask to exit. Tips: According to the Gregorian calendar, it was Monday on 01/01/01. Leap year: a year that has 36 days (29 days in February). There is a leap year every year whose number is perfectly divisible by four- except for years which are both divisible by 100 and not divisible by 400. For example: the century years 1600 and 2000 are leap years, but the century years 1700, 1800, and 1900 are not. This means that three times out of every four hundred years there are eight years between leap years. Please Do not use any Library Functions. You must document your Algorithm. Structure the program in segments of code to perform individual tasks. Examples: You can write Function for Menu or Function for the Logic. Show transcribed image text Write a C++ program to print out calendar. Ask the user which year to display. . Display the calendar for 12 months. . The code keeps on running until the user ask to exit. Tips: According to the Gregorian calendar, it was Monday on 01/01/01. Leap year: a year that has 36 days (29 days in February). There is a leap year every year whose number is perfectly divisible by four- except for years which are both divisible by 100 and not divisible by 400. For example: the century years 1600 and 2000 are leap years, but the century years 1700, 1800, and 1900 are not. This means that three times out of every four hundred years there are eight years between leap years. Please Do not use any Library Functions. You must document your Algorithm. Structure the program in segments of code to perform individual tasks. Examples: You can write Function for Menu or Function for the Logic.

Expert Answer

---

Answer to Write a C++ program to print out calendar. Ask the user which year to display. . Display the calendar for 12 months. . T… . . .