The Twelve Days of Christmas Program plan: Import necessary package. Create a class “TwelveDays”, Define the method “main ()”, Declare the necessary variables. Assign the value returned from the method “get_Choice()”. Check whether the choice is greater than or equal to “4”, Set the suffix to “th”. Otherwise, check whether the choice is “3”, Set the suffix to “rd”. Otherwise, check whether the choice is “2”, Set the suffix to “nd”. Otherwise, Set the suffix to “st”. Print the choice with the day of Christmas song. Execute switch statement for the given choice, If the choice is “12”, Print the corresponding messages until “break” occurs. If the choice is “11”, Print the corresponding messages until “break” occurs. If the choice is “10”, Print the corresponding messages until “break” occurs. If the choice is “9”, Print the corresponding messages until “break” occurs. If the choice is “8”, Print the corresponding messages until “break” occurs. If the choice is “7”, Print the corresponding messages until “break” occurs. If the choice is “6”, Print the corresponding messages until “break” occurs. If the choice is “5”, Print the corresponding messages until “break” occurs. If the choice is “4”, Print the corresponding messages until “break” occurs. If the choice is “3”, Print the corresponding messages until “break” occurs. If the choice is “2”, Print the corresponding messages until “break” occurs. If the choice is “1”, Print the corresponding messages until “break” occurs. Exit the switch using “break”. If invalid choice entered, print invalid message by default. Define the method “get_Choice()”, Declare the necessary variables. Assign the value entered into the dialog box. Parse the input. Return the choice.

Question

solve this questions for me .

Answer 1

Question

Chapter 5, Problem 10PE

Program Plan Intro

The Twelve Days of Christmas

Program plan:

Import necessary package.

Create a class “TwelveDays”,

Define the method “main ()”,

Declare the necessary variables.

Assign the value returned from the method “get_Choice()”.

Check whether the choice is greater than or equal to “4”,

Set the suffix to “th”.

Otherwise, check whether the choice is “3”,

Set the suffix to “rd”.

Otherwise, check whether the choice is “2”,

Set the suffix to “nd”.

Otherwise,

Set the suffix to “st”.

Print the choice with the day of Christmas song.

Execute switch statement for the given choice,

If the choice is “12”,

Print the corresponding messages until “break” occurs.

If the choice is “11”,

Print the corresponding messages until “break” occurs.

If the choice is “10”,

Print the corresponding messages until “break” occurs.

If the choice is “9”,

Print the corresponding messages until “break” occurs.

If the choice is “8”,

Print the corresponding messages until “break” occurs.

If the choice is “7”,

Print the corresponding messages until “break” occurs.

If the choice is “6”,

Print the corresponding messages until “break” occurs.

If the choice is “5”,

Print the corresponding messages until “break” occurs.

If the choice is “4”,

Print the corresponding messages until “break” occurs.

If the choice is “3”,

Print the corresponding messages until “break” occurs.

If the choice is “2”,

Print the corresponding messages until “break” occurs.

If the choice is “1”,

Print the corresponding messages until “break” occurs.

Exit the switch using “break”.

If invalid choice entered, print invalid message by default.

Define the method “get_Choice()”,

Declare the necessary variables.

Assign the value entered into the dialog box.

Parse the input.

Return the choice.

Expert Solution & Answer

Trending nowThis is a popular solution!

See solution

Check out sample textbook solution

Students have asked these similar questions

solve this questions for me .

a) first player is the minimizing player. What move should be chosen?b) What nodes would not need to be examined using the alpha-beta pruning procedure?

Consider the problem of finding a path in the grid shown below from the position S to theposition G. The agent can move on the grid horizontally and vertically, one square at atime (each step has a cost of one). No step may be made into a forbidden crossed area. Inthe case of ties, break it using up, left, right, and down.(a) Draw the search tree in a greedy search. Manhattan distance should be used as theheuristic function. That is, h(n) for any node n is the Manhattan distance from nto G. The Manhattan distance between two points is the distance in the x-directionplus the distance in the y-direction. It corresponds to the distance traveled along citystreets arranged in a grid. For example, the Manhattan distance between G and S is4. What is the path that is found by the greedy search?(b) Draw the search tree in an A∗search. Manhattan distance should be used as the