Final Project of MATP4820/6610 (Due at 11:59pm of May-04-2022 to ) Instructions: Two topics are given below. You must do the first topic. Bonus credit can be earned if you do both. You are required to write a report by LaTex. Discussions with classmates are allowed, but each student must write the solver(s) and report individually. To earn full credit, (a) you need to make your report well-written, include in your report all results required below each topic and all observations you make, and also, you need to make sure your code works in a right way and produce correct solutions; (b) in addition to the requirements in (a), you must show how to derive your solver, includ- ing all gradient formulas if any gradient is used, iterative update schemes, and stopping conditions. Note that you must include these in the report by mathematical formula and text description but NOT simply include your code there. Please pack your report in PDF and code in a single zip file. Do NOT zip the provided data file. Send the zip file to [email protected]. Your zip file and the PDF file should be named in the format “MATP4820 FinalProject FirstName LastName” or “MATP6610 FinalProject FirstName LastName”, depending on if you are a 4820 or 6610 student. Bonus: if you do two topics, you can earn up to 20 percent extra credit. Topic I: Support vector machine Description. Given a set of data {(xi, yi)}Ni=1 with xi ∈ Rp and the label yi ∈ {+1, −1} for each i, the linear support vector machine (SVM) aims at finding a hyperplane w⊤x + b = 1 to separate the two classes of data points. Suppose these points can be strictly separated