Any optimization problem can be solved using dynamic programming. $($True or False$)$

A problem is said to satisfy the 'Principle of Optimality' if the subsolutions of an optimal solution of the problem are themesleves solutions for their subproblems.

In Prim's algorithm, a vertex in $Y$ by an edge of minimum weight. to $Y$ is a vertex in $V-Y$ that is connected to a vertex

A proof technique, $()$ then does manipulations that lead to a result that is not true.

$f(x)=(logn{)}^2+2n+4n+logn+50$ Big$-$O$($upper bound$)$

$f(x)=n+n^2+2^n+n^4$ Big$-$O$($upper bound$)$ of

What is the time complexity T$($n$)$ of the Func below? Assume that $n$ is a power of $2.$What is the time complexity T$($n$)$ of the nested loops below? Assume that n is a power of $2.$The best$-$case time complexity of Binary Search is T$($n$)=$O$($