Please help me, Im a little confused on this problem.

Given the algorithm from the leap year case study with the lines numbered as fol 2. lows: 1. Divide the year by 4 2. IF the remainder isn't O 3. RETURN false 4. Divide the year by 100 5. IF the remainder isn't O 6. RETURN true 7. Divide the year by 400 8. IF the remainder isn't O 9. RETURN false 10. RETURN true (We know the year is not a leap year) (To get to this step, year must be divisible by 4) (We know the year is a leap year) (We know the year is not a divisible-by-400 leap year) (The year is a divisible-by-400 leap year) Indicate which line of the algorithm tells you whether the date is a leap year in each of the following cases. a. 1900 Line b. 1945 Line - c. 1600 Line d. 1492 Line- e. 1776 Line