Please type your work. Please do not copy from others.

Background on FTP - Prove that the algorithm below finds the vertex cover.

general FPT definition We say that a problem is fixed parameter tractable (FPT) with respect to parameter k if there exists a solution running in n() f (k) time, where f is a function of k which is independent of n. Vertex-Cover: Input: An undirected graph G = (V,E) and an integer k. Problem: Is there a subset of vertices S subset of V such that ISI