Consider the following problems, design the algorithms that would solve them, and then implement the algorithm in Java.

Consider the following problems, design the algorithms that would solve them, and then implement the algorithm in Java.You are free to choose between writing pseudo-code or drawing flowcharts. Make sure to include screenshots of your running programs. You can take screenshots using PrintScreen of the console window in which you run the program. Put your algorithm and the screenshots together in a Word document.Problem 1:Write a program that reads the ages of three persons from the user, and decides who is the oldest, and who the youngest person is.Problem 2:Write a program that reads in the name and salary of an employee. Here the salary will denote an hourly wage, such as $9.25. Then ask how many hours the employee worked in the past week. Be sure to accept fractional hours. Compute the pay. Any overtime work (over 40 hours per week) is paid at 150 percent of the regular wage. Print a paycheck for the employee.Problem 3:The original US income tax of 1913 was quite simple. The tax was: 1 percent on the first $50,000 2 percent on the amount over $50,000 up to $75,000 3 percent on the amount over $75,000 up to $100,000 4 percent on the amount over $100,000 up to $250,000 5 percent on the amount over $250,000 up to $500,000 6 percent on the amount over $500,000.There was no separate schedule for single or married taxpayers. Write a program that computes the income tax according to this schedule.Problem 4:Write a program asks the user to enter a month (1 for January, 2 for February, and so on) and then prints the number of days in the month. For February, print “28 or 29 days”.For example:Enter a month: 530 daysDo not use a separate if/else branch for each month. Use Boolean operators.Problem 5:A year with 366 days is called a leap year. Leap years are necessary to keep the calendar synchronized with the sun because the earth revolves around the sun once every 365.25 days. Actually, that figure is not entirely precise, and for all dates after 1582 the Gregorian corrections apply. Usually years that are divisible by 4 are leap years, for example 1996. However, years that are divisible by 100 (for example 1900) are not leap years, but years that are divisible by 400 are leap years (for example 2000). Write a program that asks the user for a year and computes whether that year is a leap year. Use a single if statement and Boolean operators. Algorithm – 2 points. Java Program – 6 points. Screenshot of the running program – 2 points