Prove that the algorithm Greedo is using is a 2-approximation for $\binpacking$. That is, prove that the value obtained by this algorithm is no more than twice the minimum number of bins, $b^*$, needed to contain all $n$ items.

The value of sin(x) (in radians) can be approximated by the alternating infinite series create a function (prob3_2) that takes inputs of a scalar angle measure (in radians) and the number of approximation terms, n, and estimates sin(x). do not use the sin function in your solution. you may use the factorial function. though this can be done without a loop (more efficiently), your program must use (at least) one. you may find the mod() function useful in solving the problem.