Suppose you have a machine that executes a program consisting of 50% floating point multiply, 20% floating point divide, and the remaining 30% are from other instructions. Management wants the machine to run 4 times faster. You can make the divide run at most 3 times faster and the multiply run at most 8 times faster. Can you meet management's goal by making only one improvement, and which one? Amdahl's Law states: Execution time after improvement = (Execution time affected by improvement)/(Amount of Improvement) + Execution time unaffected

I need help with programming in MATLAB. The following code transforms cartesian coordinates to the kepler elements. Can you give me the code for transforming kepler orbital elements to cartesian coordinates. The following code gives the 6 kepler elements. Transform those elements into cartesian coordinate that match the values under the Example Usage part of the code.   % Example usage:x = 1000;   y = 2000;   z = 3000;   vx = 4;     vy = -3;    vz = 2;      [a, ecc, inc, raan, argp, f] = cart2orb(x, y, z, vx, vy, vz); % Display the resultsdisp(['Semi-Major Axis (a): ', num2str(a), ' km']);disp(['Eccentricity (ecc): ', num2str(ecc)]);disp(['Inclination (inc): ', num2str(inc), ' degrees']);disp(['Right Ascension of Ascending Node (raan): ', num2str(raan), ' degrees']);disp(['Argument of Perigee (argp): ', num2str(argp), ' degrees']);disp(['True Anomaly (f): ', num2str(f), ' degrees']);   function [a, e, inc, raan, argp, f] = cart2orb(x, y, z, vx, vy, vz)    % Gravitational constant for…

What is wrong with the following code? the end goal is to run the program and to be able to find the area of two circles. However, when running the program I encounter an error. The language being used is C++

Write a program named stars.py that has two functions for generating star polygons. One function should be implemented using an iteration (a for loop), and another function should be a recursion. It is optional to fill in your shapes. The functions for generating stars should be named star (size, n, d=2) and star_recursive (size, n, level, d=2), where size is the size of the polygon side (edge), n is the number of sides (or angles), d is a density or winding number that should be set to default value 2, and level is the level of recursion initially equal to n.