Suppose an algorithm was found for multiplying two n-digit numbers which recursively multiplied four pairs of n/3-digit numbers then combined the results in O(n) time.

Provide the recurrence relation for this new algorithm

Use the master method to determine to find the solution to the recurrence relation in Big-Oh notation.

Would this be faster than multiplying two n-digit numbers using a divide and conquer teachnique which recursively multiplied three pairs of n/2-digit numbers then combined the results in O(n) time