Problem 1: Program a function div_alg(a, d) that computes the quotient and remainder of two integers a and d, according to the Division Algorithm (THM 4.1.1). The function should satisfy the following: 1. INPUT: a - an integer representing the dividend d-positive integer representing the divisor . 2. OUTPUT: a dictionary of the form {'quotient' : q, "remainder' : r} where q and r are the quotient and remainder values, respectively. The remainder should satisfy, 0 > div_alg( 101 , 11 ) {'quotient' : 9, 'remainder' : 2} In [ ]: def div_alg(): # FIXME: Implement this function pass