Please see the attached document for the question all properly formatted.
I would like to suggest you to read the books of "Linear programming and network flows " of Mokhtar bazaraa.
It will help you, especially the second chapter.
However I tried to solve your problem like what you need .
Hint: Ct means "C transpose"
Lp in standard form is
min Ct X
The number of constraint here are the same but the number of ...
This solution is comprised of a detailed explanation to find the duals of the LP problem and find the basic solutions to the primal. This has all been completed in 275 words.