Problem 1 Consider the following optimization problem: min f(x, y) = 3² + y* x,y Solve the problem computationally - once by running gradient descent algorithm, and once by running the Newton descent algorithm. Report all parameters used in the two algorithms and the number of iterations to convergence. You have to use Python.

Python

ii.Building on your decomposition for part c.i., develop an algorithm for solving the problem. Include this algorithm in your solution document, and also write down your PI and the individual number that you have obtained via Steps 1–3 from your PI H5737055

1. Suppose that a set of samples x1, x2, ..., xn, all real numbers, are drawn i.i.d. from the same distribution. Also assume that this distribution is a Gaussian distribution, which can be represented as N(µ, o²). Write a function that accepts a set of samples and returns the MLE estimator for µ. NOTE: The code below will be evaluated by a Python 2.7 interpreter. 1 def mle(samples): 2 pass Run Reset Once your function is correct, your will receive a submission code that you should input into the answer field. Enter answer here

USE PYTHON LANGUAGE. READ INPUT FROM FILE (NAME THE FILE "input.txt') The problem needs to be solved using Greedy Algorithm Strategy.   Problem: Suppose, you have N number of assignments with their time intervals- i.e. starting and ending times. As you are a student, you need to find out how you can finish the maximum number of assignments. Now, Implement a greedy algorithm to find the maximum number of assignments that can be completed by you. The following conditions must be met when writing the code: A student can only work on a single assignment at a time. The input will contain N assignments, and then N lines with the starting time and ending time in the format given below: N S₁ E₁ S₂ E₂ ……. Sn En   You have to read input from a file. The output will contain the maximum number of assignments that can be completed followed by the intervals of the selected assignment. Sample input and output is given below "input.txt”. Make sure to try out different input examples to ensure that…

Please, the subject is about programming and the topic is about cycles and you must design the algorithms I ask for. Thanks :)