Solve the following two problems and submit your solution here as a Github URL: Problem 1) Find and show how to compute Big O for the following algorithm: 70% Problem 2) You have 20M \&M bags. 19 bags have 1.0 gram pieces, but one has pieces of weight 1.1 grams. Given a scale that provides an exact measurement, how would you find the heavy bag? You can only use the scale once. 30% Please describe your solution using a MS Word document