3. Use the Master Theorem to give the O-order of the following algorithms: (a) Algorithm A divides its input into two parts of equal size using constant work, then recurses on both parts. After the recursive calls linear work is performed. What is the run time of this algorithm? ? binery bit ng (b) Algorithm B divides its input into two parts of equal size using constant work, and then recurses on one part. After the recursive call, constant work is performed. What is the run time of this algorithm? (c) Algorithm C divides its input into 8 parts of equal size using constant work, and then recurses on 7 part. After the recursive call, qudratic work is performed. What is the run time of this algorithm