Write a program that calculates and displays the total travel expenses of a businessperson on a trip. The program should have functions that ask for and return the following: The total number of days spent on the trip • The time of departure on the first day of the trip, and the time of arrival back home on the last day of the trip • The amount of any round-trip airfare • The amount of any car rentals • Miles driven, if a private vehicle was used. Calculate the vehicle expense as $0.27 per mile driven • Parking fees (The company allows up to $6 per day. Anything in excess of this must be paid by the employee.) • Taxi fees, if a taxi was used anytime during the trip (The company allows up to $10 per day, for each day a taxi was used. Anything in excess of this must be paid by the employee.) • Conference or seminar registration fees •Hotel expenses (The company allows up to $90 per night for lodging. Anything in excess of this must be paid by the employee.) • The amount of each meal eaten. On the first day of the trip, breakfast is allowed as an expense if the time of departure is before 7 a.m. Lunch is allowed if the time of departure is before 12 noon. Dinner is allowed on the first day if the time of departure is before 6 p.m. On the last day of the trip, breakfast is allowed if the time of arrival is after 8 a.m. Lunch is allowed if the time of arrival is after 1 p.m. Dinner is allowed on the last day if the time of arrival is after 7 p.m. The program should only ask for the amounts of allowable meals. (The company allows up to $9 for breakfast, $12 for lunch, and $16 for dinner. Anything in excess of this must be paid by the employee.) The program should calculate and display the total expenses incurred by the businessperson, the total allowable expenses for the trip, the excess that must be reimbursed by the businessperson, if any, and the amount saved by the businessperson if the expenses were under the total allowed. Input Validation: Do not accept negative numbers for any dollar amount or for miles driven in a private vehicle. Do not accept numbers less than 1 for the number of days. Only accept valid times for the time of departure and the time of arrival. *Format your output accordingly.

What are some of the various approaches to data flow documentation?

It is not easy for a compiler to generate efficient and error-free code without considering a wide range of parameters. Explain?

Is there any benefit to using dynamic programming while making a series of connected decisions? What's the story?

In order for a compiler to generate reliable and efficient code, it must take into consideration a wide range of conditions. Explain?

Using concrete examples, please provide your thoughts on the software structure review procedure.

A manager of a department at Google wants to schedule 15-min coffee chat between two employees every week for his 6 employees. Design and write a program to help this manager.   Each employee should have a meeting with a new person. So, no meeting with the same person until they meet all the other colleagues. Use functional programming or object-oriented programing. You can have your own design to cover the requirements but you should consider a design with better time complexity. You can use any data structures (lists, dictionaries, stacks, queues, ...) The number 6 here is an example and imaging there are "n" (an even number) employees in the group (for this example n =6) Every week each employee should have a meeting and just one meeting with one person. Every week they should have a meeting with a new person. Until week 5 ( n-1 weeks) they should have a meeting with the same person.   employees = [ employee_1, employee_2, employee_3, employee_4, employee_5, employee_6] It means…

What parts of compiler design must be emphasised in order to guarantee that the end result is both effective and trustworthy? Explain.

This course will cover testability and quickly explain the compiler.

Please explain the pros and cons of using dynamic programming in comparison to more conventional approaches.