You are modeling a small part of an online flight reservation system, according to the following description. A flight is a single non-stop hop between a pair of cities. A booking can include several flights and travelers (think of a family vacation hitting multiple cities), with the requirement that all the travelers are on all the flights in a booking. Furthermore, every booking has a single owner who is one of the travelers on that booking (think one family member booking the tickets for the entire family), and the owner can manage functionality on the system that other travelers cannot. A separate ticket is issued and priced individually for each traveler on a booking, and the ticket applies to all flights within that booking. Draw the most appropriate UML diagram for your model. Identify entities (classes/abstract classes/interfaces) clearly, and separate them according to their functionality--the separation should be faithful to the description above. Set up relationships between entities as precisely as possible. Inside each class in the diagram, only list the class name and minimal number of attributes required to characterize objects of that class (no operations needed). For the attributes, you are not required to show access level. For any ONE association, code the classes involved, detailing the fields ONLY.

When keyboarding, if you want to be fast and accurate you should return your hands on home row with your fingers relaxed and your eyes on the text use only your index fingers to hunt and peck keep your fingers stiff and your eyes on the keys slouch in your chair and keep your fingers hovering over all of the keys

We as humans write math expression in infix notation, e.g. 5 + 2 (the operators are written in-between the operands). in a computer’s language, however, it is preferred to have the operators on the right side of the operands, i.e. 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: 1guidelines: 1. you will need to use stacks in three placesa. one for the parenthesis check [char stack]b. one during infix to postfix [char stack]c. one during evaluation [int stack]for a and b above, you can use same array and same push, pop method as both ofthem are char. but for evaluation you have int stack and you might consider to createanother push pop method to handle it. maybe push_int, pop_int, etc. or find otherstrategy to utilize existing push pop method2. you can create a function for obtaining operator priority. that function should take anoperator as input and return its priority as an integer. this function will you a lot andreduce repeated code3. during evaluation you will need to convert char into integer. example for single digit: char c = '5'; int x = c - '0';

Least square fit to polynomial write a function leastsquarefit3pol that solves a linear system of equations to find a least squares fit of a third order polynomial to an experimental data set given as two row arrays. the function leastsquarefit3pol must explicitly solve a set of linear equations and cannot use polyfit. there should be no restriction on the size of the problem that can be solved.