Draw the recursion tree for both the methods and then analyzethe time complexity of both versions using recurrence tree methodand Masters Theorem. Q2. Consider the following pseudocodes for calculating \( \mathrm{a}^{\mathrm{b}} \), where \( \mathrm{a} \) and \( \mathrm{b} \) are positive integers. Method FastMath1 and FastMath2 Input: positive 1 answer