Problem D: Different Dice Game Consider the following game for two players: The first player rolls a pair of dice of fair six-sided dice. If the two dice show different numbers, the player's score is the larger of the two numbers. Otherwise, the player's score is the sum of the two numbers. At this point, the player is asked if they want to remove their lower die and re-roll one die. If they say no, the player keeps her score and their turn is over. If they say yes, then they roll one more die and the number showing on this die replaces the lower of the original two rolls. Then these two dice rolls are scored accordingly. (For example, if the initial roll was a 2 and 5, if the player doesn't roll again, she gets 5 points. If she does roll again and obtains a 4, her score is still 5. If she rolled again and obtained a 6, her score would be a 6. If she rollwed again and obtained a 5, her score would be a 10.) The second player goes after the first, doing the exact same steps as the first…

Sort Three Numbers Write a program that requests three different numbers as input and then displays the numbers in order. Use a Procedure named Sort to which the three values are passed ByRef and use a “Swap” procedure similar to the one in Example 3. See Fig. 5.36.

Explain how many times the following loop is executed

dictionaries = [] dictionaries.append({"First":"Bob",      "Last":"Jones"}) dictionaries.append({"First":"Harpreet", "Last":"Kaur"}) dictionaries.append({"First":"Mohamad",  "Last":"Argani"})   for i in range(0, len(dictionaries)):     print(dictionaries[i]['First'])   ************************************************* please modity the above code to "Add an ‘if’ statement(s) to the loop in your solution in Exercise 7 to only show the full name if the first name is “Bob” or if the last name is “Kaur”.

Part  a:Finding Pythagorean Triples with OpenMP [in C++ plz]Write a program that calculates Pythagorean triples using nested for loops. The Pythagorean Theoremstates the following:?2 + ?2 = ?2Where a, b, and c are whole numbers. Part b: Modifying the Pythagorean Theorem Modify the Pythagorean Theorem by either adding or subtracting a times b on the left-hand-side, andrun the program again. Are there integer solutions for this??2 + ?2 + ??= ?2

Chapter 5B Exercise 1 - Extra Exercise - Holy Digits Holy digits Batman! The Riddler is planning his next caper somewhere on Pennsylvania Avenue. In his usual sporting fashion, he has left the address in the form of a puzzle. The address on Pennsylvania is a four-digit number where: All four digits are different The digit in the thousands place is three times the digit in the tens place The number is odd The sum of the digits is 27 Write a program that uses a loop (or loops) to find the address where the Riddler plans to strike.

Assume the RIMS environment for exercises below. Write C statements that set B to the reverse complement of A, such at B7 = ~A0, B6 = ~A1, etc. Rather than writing 8 assignment statements, instead write a for loop that makes use of the GetBit and SetBit functions.

c++ 1. Write a short program to compute the number of hours in a non-leap year. Compile and run, show me the source code and the output screen.

Problem B  Musical Key ConversionThe chromatic scale is a 12-note scale in music in which all notes are evenly spaced: that is, the ratio of the frequency between any two consecutive notes is constant. The notes are typically labeled in the following sequence: A, A#, B, C, C#, D, D#, E, F, F#, G, G# After G#, the labels loop back and start over with A (one octave higher). To convert between musical keys, you can shift all notes in a piece of music a constant number of steps along the scale above. For example, the sequence of notes E, E, F, G, G, F, E, D, C, C, D, E, E, D, D can be converted to another musical key by shifting everything up three steps: E, E, F, G, G, F, E, D, C, C, D, E, E, D, D G, G, G#, A#, A#, G#, G, F, D#, D#, F, G, G, F, F Notice that G was converted to A#, since going three steps up required us to loop off of the top of the scale back to the bottom: G -> G# -> A -> A#. Technically we should note that this would be A# of the next octave up, but we’ll…