please anyone explain it question by question,thank you

(50pts) 1. Implement Gale-Shapley Algorithm for computing Stable Marriage Assignment in any language, such as Python, Java, C++ or MATLAB, using the approach and data structures described in the first two Chapters of the Kleinberg and Tardos text. The input file should include number of subjects, n, preference list for men and women one line for each. a) Write a function to create preference lists for men and women. Function should take number of men (women), say n, create preferences and output them. b) Write a function to check if there are any unstable pairs in a given match set and preference lists. Turn in sample inputs and corresponding outputs in separate files. c) Implement Gale-Shapley algorithm and run 5 times for n=10 with different input files and plot the variation in the running time. d) Run the algorithm implemented 5 times for n=10 with the same input file and plot the variation in the running time. e) Run the algorithm implemented 5 times for n=10,15,20,50,100, and plot the average running time as a function of the problem input size (n). f) Run the algorithm implemented 5 times for n=10 with the same preference lists, let a different man start proposing and output the matches created