Using the Master Theorem, give a tight $O()$ bound on the value of the solution of the following recurrence relation:

$T(n)=T(\frac{n}{2})+1,T(0)=1$

Using the Master Theorem, give a tight $O()$ bound on the value of the solution of the following recurrence relation:

$T(n)=T(\frac{n}{2})+n,T(0)=1$

Using the Master Theorem, give a tight O$()$ bound on the value of the solution of the following recurrence relation:

$T(n)=8T(\frac{n}{2})+n^2,T(0)=1$

Using the Master Theorem, give a tight $O()$ bound on the value of the solution of the following recurrence relation:

$T(n)=7T(\frac{n}{2})+n^2,T(0)=1$

Using the Master Theorem, give a tight $O()$ bound on the value of the solution of the following recurrence relation:

$T(n)=7T(\frac{n}{2})+{2\mathrm{.}7183}^{3\mathrm{.}1416}{n}^2,T(0)=1$