subject

The Harrison Group Life Insurance company computes annual policy premiums based on the age the customer turns in the current calendar year. The premium is computed depending on the users age. If the user is under the age of 50 ā€“ it is calculated by taking the decade of the customerā€™s age, adding 15 to it, and multiplying by 20. For example, a 34-year-old would pay $360, which is calculated by adding the decades (3) to 15, and then multiplying by 20.
If the user is over 50 ā€“ it is calculated by taking the decade of the customerā€™s age, adding 20 to it, and multiplying by 25. For example, a 54-year-old would pay $625, which is calculated by adding the decades (5) to 20, and then multiplying by 25.
Write an application that:

Declares the variables needed.
Prompts a user for their decade age (be clear in the instructions that you want only the 10s or 100s place).
Hits an IF statement that will call on a method named calculaterate and will pass it the decade, the addition number and the multiplier based on that IF statement.
The method should calculate the premium and return it to the main method.
The main will then display it out to the user.
The user will then be asked if they want to enter in another number. (While or Do While ā€“ your Choice) in persudo code please

ansver
Answers: 2

Another question on Computers and Technology

question
Computers and Technology, 21.06.2019 21:30
What is linux? an open source operating system a version of ms dos the first version of unix the newest technology available
Answers: 1
question
Computers and Technology, 22.06.2019 05:20
Write a program called assignment3 (saved in a ļ¬le assignment3.java) that computes the greatest common divisor of two given integers. one of the oldest numerical algorithms was described by the greek mathematician, euclid, in 300 b.c. it is a simple but very eā†µective algorithm that computes the greatest common divisor of two given integers. for instance, given integers 24 and 18, the greatest common divisor is 6, because 6 is the largest integer that divides evenly into both 24 and 18. we will denote the greatest common divisor of x and y as gcd(x, y). the algorithm is based on the clever idea that the gcd(x, y) = gcd(x ! y, y) if x > = y and gcd(x, y) = gcd(x, y ! x) if x < y. the algorithm consists of a series of steps (loop iterations) where the ā€œlargerā€ integer is replaced by the diā†µerence of the larger and smaller integer. this continues until the two values are equal. that is then the gcd.
Answers: 3
question
Computers and Technology, 22.06.2019 16:10
Drag each label to the correct location on the imagelist the doā€™s and donā€™ts of safeguarding your password.keep yourself loggedin when you leave your computer.donā€™t write your password down and leave it whereothers can find it.share your password with your friends.each time you visit a website,retain the cookies on your computer.use a long password with mixed characters.
Answers: 1
question
Computers and Technology, 23.06.2019 00:20
Ihave been given the number of guns per 100, and the total firearm-related deaths per 100,000. i have to find the actual number of guns per country and actual number of gun-related deaths. if somebody could show me how to do 1 question, i can finish the rest, i am just confused. tia
Answers: 3
You know the right answer?
The Harrison Group Life Insurance company computes annual policy premiums based on the age the custo...
Questions
question
Mathematics, 16.10.2020 08:01
question
Mathematics, 16.10.2020 08:01
question
Physics, 16.10.2020 08:01
question
Chemistry, 16.10.2020 08:01
question
Mathematics, 16.10.2020 08:01