Let A and B be two sets of n positive integers. You get to reorder each set however you like. After reording, let ai be the i-th element of A and bi be the i-th element of B. The goal is to maximize the function n Π (i=1) ai^bi . You will develop a greedy algorithm for this task. Required:
a. Describe a greedy idea on how to solve this problem, and shortly argue why you think it is correct (not a formal proof).
b. Describe your greedy algorithm in pseudocode. What is its runtime?

Report all segments of identity by descent longer than 20 polymorphisms between pairs of individuals in the following cohort of 15 individuals across 49 polymorphisms: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 numeric input 2 points possible (graded) you have 2 attempts to complete the assignment below. for example if the sequence is "bcd", which occurs in "abcdef" , the starting point would be 2 (b), and the finishing point would be 4(d). individuals 7,10 between positions