Write the Algorithm for Travel Salesman Problem with its efficiency.

Design a brute$-$force algorithm for computing the value of a polynomial

$P(x)=a_n{x}^n+a_{n-1}{x}^{n-1}+a_{n-2}{x}^{n-2}+a_{n-3}{x}^{n-3}+a_{n-4}{x}^{n-4}-$cdots$-$cdots$-$cdots$-a_0$ at a given

point $x_0$ and determine its worst$-$case efficiency class.$$Fill in the given values you have, and we'll solve for the missing variable.$P=VI$

$P$	$=$	$\text{power}$
$V$	$=$	$\text{voltage}$
$\text{I}$	$=$	$\text{current}$