Suppose a recursive algorithm performs 2 recursive calls. Assume the first recursive call is of size at most 70% the original input size, and the second call is of size at most 25% of the original...

Suppose a recursive algorithm performs 2 recursive calls. Assume the first recursive call is
of size at most 70% the original input size, and the second call is of size at most 25% of the
original input size. In addition, the algorithm performs O(n) additional work after making
these recursive calls. What is the big-Oh run time of this algorithm?