Please code in python Kiki is making “Happy National Pizza Day” (February 9th) cards for all of her friends. She’s a bit disappointed with the cards not looking special enough, so she decides to add glitter to them to make them look more special. However, she’s short on glitter, so she decides to add glitter selectively. She uses a box with N*N divided sections to store her cards. Each section is huge and each card is small, so she can put multiple cards in a given section and they will never overlap. We model the way that she organizes the cards and adds glitter using two commands: Command 1:       1  x  y: add a card to the box in section (x, y). Command n:       2  x1  y1  x2  y2: Add one unit of glitter to each of the cards in the sections from (x1, y2) to (x2, y2). Help Kiki determine the total number of units of glitter that she placed on the cards. Input The first line will contain N (1 <= N <= 500) and C (1 <= C <= 500 ), the square size of the card storage box…

Lab 15.1 Greatest Common Divisor A formula for finding the greatest common divisor (GCD) of two numbers was formulated by the mathematician Euclid around 300 BCE. The GCD of two numbers is the largest number that will divide into both numbers without any remainder. For example, the GCD of 12 and 16 is 4, the GCD of 18 and 12 is 6. The basic algorithm is as follows: Assume we are computing the GCD of two integers x and y. Follow the steps below: 1. Replace the larger of x and y with the remainder after (integer) dividing the larger number by the smaller one. 2. If x or y is zero, stop. The answer is the nonzero value. 3 If neither x nor y is zero, go back to step 1. Here is an example listing the successive values of x and y: $ (135 / 20) - 15 $ (20 / 15) = 5 * (15 / 5) = 0 135 20 15 20 15 5 5 GCD = 5 Write a recursive method that finds the GCD of two numbers using Euclid's algorithm. public class Arithmetic { public static int gcd(int a, int b) // Your work here Lab 15.2 Tester for GCD…