Please provide matlab code

The equation, 5 e-(x-2) - x4 + 1 = 0, has one positive solution (around 1.48194) and one negative solution (around -1.00015). In this exercise, the original equation is rearranged into the form, x = g(x), and Fixed-point iterative method is used to seek the solution. (i) Given the initial guess of x = 1, find a form of g(x) such that the iterative process converges to the positive solution. (ii) Given the initial guess of xo = 1, find a form of g(x) such that the iterative process converges to the negative solution. (iii) Given the initial guess of x = 10, find a form of g(x) such that the iterative process converges to the positive solution. For case (i) and (ii), the key deliverable is the form of g(x). No need to show detailed output of the iterative process. For case (iii), in addition to giving the form of g(x), please briefly explain how (based on what reasons) the "good choice of g(x) is obtained. Otherwise, no need to show detailed output of the iterative process. Since the codes used for all cases are the same except in the detail of g(x), for this problem please just provide the segment of the code that is common to all three cases, plus the portion of the code for the calculation of g(x) (for the three g(x)'s in the three cases)