For this problem A is an array of length n objects that has at most k distinct keys in it, where. Our goal is to compute a sorted array B that contains the k distinct keys occurring in A. a. Design an algorithm that is computing the sorted array B of length k containing the k distinct keys. The value of k is not provided as input to the algorithm. b. Analyze your algorithm for part a.

Using the artofstat website, run a permutation test to see if there is a difference in the mean amount of time spent on emails per day between in state and out of state students. (make sure to generate 10,000 permutations.) in state students: 2 3 3 6 2 1 1 5 3 2.5 out of state students: 1 2 2 1 2 1 4 3 9 1 10 1 3 what is the p-value?

Write a function that draws a pool ball. this function should take as parameters, the color, the number that should go on the pool ball, and the location of the center of the pool ball. the radius of the pool balls should be pool_ball_radius, and the font of the number should be pool_ball_font. the text of the pool ball font should be white. drawpoolball(color. orange, 5, 100, 100); drawpoolball(color. green, 6, 50, 200); drawpoolball(color. red, 3, 150, 350); drawpoolball(color. blue, 2, 250, 140); to center the numbers on the pool ball, you should use the getwidth() and getheight() methods. you are allowed to call these methods on your text object, such as txt.

Write a function so that the main program below can be replaced by the simpler code that calls function original main program: miles_per_hour = float( minutes_traveled = float( hours_traveled = minutes_traveled / 60.0 miles_traveled = hours_traveled * miles_per_hour print('miles: %f' % miles_traveled) sample output with inputs: 70.0 100.0 miles: 116.666667