Create a Python program (Filename: minimize.py) to perform the following optimization problem. Minimize 3-2 sin(x) 1 This optimization is to find the minimum value of x3 - 2 sin(x)1 when 0 s xs1. This optimization problem can be approximately solved by simply searching in the feasible range. In the program, you can simply define a list x [0, 0.01, 0.02, , 0.98, 0.99, 1.0] by list comprehension and also define an objective function as f(x) 3 2sin(x) 1, and search for the minimum f(x) of different values in the list x. Create a Python program (Filename: count.py) to count the frequency for each unique value in a list A. Set A in the beginning of the program For example: A [10, 3, 2, 8, 10, 3, 10, 10 Then, the program will print: The unique values of A are 2, 3, 8, 10 Frequency of the element 2 is 1. Frequency of the element 3 is 2. Frequency of the element 8 is 1. Frequency of the element 10 is 4. Note: You may use A.count(v) to count how many elements that have the value v in A. Please think about how to get the unique values in a list. Manual calculation will get 0 points