You should complete the below function and ensure it produces the correct output against all test cases possible within the constraints highlighted. The runtime of the program is important so it is best to use an algorithm in the code which will not timeout. Please ensure that the code passes all the possible test cases and ensure that it doesn't timeout

Utopian Tree Problem Submissions Leaderboard Discussions The Utopian Tree goes through 2 cycles of growth every year. Each spring, it doubles in height. Each summer, its height increases by 1 meter. A Utopian Tree sapling with a height of 1 meter is planted at the onset of spring. How tall will the tree be after n growth cycles? For example, if the number of growth cycles is n = 5, the calculations are as follows: Period Height 1 1 2 2 3 3 6 4 5 14 Function Description Complete the utopian Tree function in the editor below. utopian Tree has the following parameter(s): int n: the number of growth cycles to simulate Returns int: the height of the tree after the given number of cycles Input Format The first line contains an integer, t, the number of test cases. t subsequent lines each contain an integer, n, the number of cycles for that test case. Constraints 1