Analyze the following recurrences and show their time complexity functions using

$(1)$

$$iteration method. T

$($

n

$)$

$=$

$$T

$($

n

$-$

$2)$

$+$

$3$

$,$

$$T

$(1)$

$=$

$1$