22. 22. List the hexadecimal code for the following program (hand- assemble it). Hex Address Label Instruction 100 LOAD A 101 ADD ONE 102 JUMP S1 103 S2, ADD ONE 104 STORE A 105 HALT 106 s1, ADD A 107 JUMP S2 108 A, HEX 0023 109 One, HEX 0001

A1.1.6 (a) create the recursive function BinaryGCd (a,b) based on the following pseudo code # recursive pseudo-code def BinaryGCF (a,b): arrange order so ab if a=0: if a and b are even: else if a is even: else if b is even: else: done, b is GCF GCF (a,b) = 2*GCF (a/2, b/2) GCF (a,b) = GCF (a/2, b) GCF (a,b) GCF (a,b) In [ ]: def BinaryGCF (a,b): GCF (a,b/2) GCF (a,b-a) (b) demonstrate that it gives the same results as pfGCD (a,b) and EuclidGCD (a, b) from A1.5. "enter the recursive code below" for a,b in [(660,350), (99,53), (30,84)]: # demonstrate all GCD functions give the same result 13

4.6.1: Recursive function: Writing the base case.   Add an if branch to complete double_pennies()'s base case.Sample output with inputs: 1 10Number of pennies after 10 days: 1024 Note: If the submitted code has an infinite loop, the system will stop running the code after a few seconds, and report "Program end never reached." The system doesn't print the test case that caused the reported message   # Returns number of pennies if pennies are doubled num_days timesdef double_pennies(num_pennies, num_days):total_pennies = 0 ''' Your solution goes here ''' else:total_pennies = double_pennies((num_pennies * 2), (num_days - 1)) return total_pennies # Program computes pennies if you have 1 penny today,# 2 pennies after one day, 4 after two days, and so onstarting_pennies = int(input())user_days = int(input()) print('Number of pennies after', user_days, 'days: ', end="")print(double_pennies(starting_pennies, user_days))

7.19 Please use Python correctly thanks!  def is_valid_month(date_list):    """    The function ...    """    # TODO: Finish the function    def is_valid_day(date_list):    """    The function ...    """    num_days = {        1: 31,        2: 28,        3: 31,        4: 30,        5: 31,        6: 30,        7: 31,        8: 31,        9: 30,        10: 31,        11: 30,        12: 31    }    # TODO: Finish the function     if __name__ == "__main__":    # test incorrect types    assert is_valid_month([12, 31, 2021]) == False    assert is_valid_day([12, 31, 2021]) == False    assert is_valid_year([12, 31, 2021]) == False        # test the correct input    assert is_valid_month(["01", "01", "1970"]) == True    assert is_valid_month(["12", "31", "2021"]) == True    assert is_valid_day(["02", "03", "2000"]) == True    assert is_valid_day(["12", "31", "2021"]) == True    assert is_valid_year(["10", "15", "2022"]) == True    assert is_valid_year(["12", "31", "2021"]) == True     ### test…