Consider the statements below. For each statement, classify if the statement is True or

False. No Justification required. Each question is of $2$ marks.

Problem $1.$ We can use complementary slackness theorem to simplify the dual linear program based

on OPT$($primal$),$ but not in reverse direction.

Problem $2.$ For every flow network with at most m edges, there exists a sequence of at most m

augmentations that lead to a max flow.

Problem $3.$ We cannot reduce Traveling Salesman problem to Subset Sum problem in polynomial

time.