Consider a planet that follows an elliptical orbit. The perimeter of an ellipse with a major axis a and minor axis b is 4a V1 - k-sin-e do where k = Va? – b?. For a given a major axis a and minor axis b, calculate the distance the planet travels, by completing: a 1. the subfunction TrapzPlanet that uses trapeziodal numerical integration (using the internal function trapz) and a given number of discrete points.
2. the subfunction IntegratePlanet that uses the internal function integral.
Ex:
a = 3.01*10^ 9; b = 2.74*10^9; [trapzApprox, numIntegrate] = PlanetDistance(a, b, 1000) produces trapzApprox = 1.8074e+10 numIntegrate = 1.8074e+10 Function Save C Reset MATLAB Documentation 2 1 function [trapz Approx, numIntegrate] PlanetDistance(a, b, points) trapzApprox=TrapzPlanet(a, b, points); numIntegrate=IntegratePlanet(a, b); 4 end 3 5 6 function trapzApprox=TrapzPlanet(a, b,points) 7 8 % Your code goes here 9 10 end 11 12 function numIntegrate=IntegratePlanet(a, b) 13 14 % Your code goes here 15 16 end Code to call your function C Reset 1 a = 3.01*10^9; b = 2.74*10^9; 2 [trapzApprox, numIntegrate] = PlanetDistance(a, b, 1000)

In a file-oriented information system, a work file stores relatively permanent data about an entity is created and saved for backup and recovery purposes stores records that contain day-to-day business and operational data is a temporary file created by an information system for a single task

For this assignment you have to write a c program that will take an infix expression as input and display the postfix expression of the input. after converting to the postfix expression, the program should evaluate the expression from the postfix and display the result. what should you submit? write all the code in a single file and upload the .c file. compliance with rules: ucf golden rules apply towards this assignment and submission. assignment rules mentioned in syllabus, are also applied in this submission. the ta and instructor can call any students for explaining any part of the code in order to better assess your authorship and for further clarification if needed. problem: we as humans write math expression in infix notation, e.g. 5 + 2 (the operators are written in-between the operands). in computer's language, however, it is preferred to have the operators on the right side of the operands, ie. 5 2 +. for more complex expressions that include parenthesis and multiple operators, a compiler has to convert the expression into postfix first and then evaluate the resulting postfix write a program that takes an "infix" expression as input, uses stacks to convert it into postfix expression, and finally evaluates it. it must support the following operations: + - / * ^ % ( example infix expression: (7-3)/(2+2) postfix expression: 7 3 2 2 result: rubric: 1) if code does not compile in eustis server: 0. 2) checking the balance of the parenthesis: 2 points 3) incorrect postfix expression per test case: -2 points 4) correct postfix but incorrect evaluation per test case: -i points 5) handling single digit inputs: maximum 11 points 6) handling two-digit inputs: 100 percent (if pass all test cases)

Which of the following statements best describes it careers?