/static/ace/ace-profile-1.d6755e5803e8.svg alt=#https://www.numerade.com/static/ms-icon-310x310-bungalow.529ff1334847.png

INFO:
VIDEO ANSWER: Hello students in this question we are given the recursion relation AN is equal to 2a n minus 1 minus 3 this is equal to minus 3 plus twice of a n minus 1 would be 2a n minus 2 minus 3 and this is equal to minus 3 plus twice of minus 3
find the worst case complexity function tn of the below algorithm as a recurrence relation considering only comparison and arithmetic operations mark the option which also specifies the comp 06352