Please answer each question and write clearly, thank you!

Question 1. (Placement and Partitioning by using K-L Algorithm) -50 points Solve min-cut partitioning problem for the following example circuit by using the Kerningham-Lin Algorithm. Dashed line shows initial partitioning for this example. V2 1V31'6 2 V7 I) Fill out all the values of the difference and gain table for required passes (refer to the Fig. 7.13 and Fig. 7.14 in the textbook) (10 points) The First Pass: BD Ai The Second Pass: Question 1. (Placement and Partitioning by using K-L Algorithm) -50 points Solve min-cut partitioning problem for the following example circuit by using the Kerningham-Lin Algorithm. Dashed line shows initial partitioning for this example. V2 1V31'6 2 V7 I) Fill out all the values of the difference and gain table for required passes (refer to the Fig. 7.13 and Fig. 7.14 in the textbook) (10 points) The First Pass: BD Ai The Second Pass