Code Problem 4 in Python 2. Problem 4

You’ve been hired to write a Python program for scanned items at a grocery mart. The scan is of the form [x, y, z] where x is the number of items purchased, y is the price of the item, and z is whether the item is taxable (7% tax on grocery items). For example assume you were given the list below:
[[1, 1.45, 1], [3, 4.24, 1], [2, 14.00, 0], [4, 1.25, 1]]
This means the amount owed is:
amt = 1(1.45) (1.07) + 3(4.24) (1.07) +2(14.00) + 4(1.25) (1.07)
= ((1.45 + 12.72 + 5.00)1.07) + 28.00
= 19.17(1.07) + 28.00
= 20.51 + 28.00
= 48.51

Code the problem in Python 2 and add “comments explaining what the code is doing.

Write a program called assignment3 (saved in a file 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.

What does a cascading style sheet resolve a conflict over rules for an element? a. the rule affecting the most content wins b. the rule affecting the most content loses c. the rule with the most specific selector loses d. the rule with the most specific selector wins

What is the digital revolution and how did it change society? what are the benefits of digital media?