Write the dual of the following linear program without converting it to the standard form.

max,$x_n-x_1$

subject $to{x}_{i+1}-x_{i}i,$AAi$=1,$dots,$n-1$

$,x_i$ free AAi$=1,$dots,$n$

What is the unique solution to the dual program?Write the dual of the following linear program without converting it to the standard form.

max xn $$ x$1$

subject to xi$+1$ xi i $$i $=1,...,$ n $1$

xi free $$i $=1,...,$ n

What is the unique solution to the dual program?

can you please clarify how did you get the dual objective functions and restrictions?