please write in word and submit in pdf

1. This is an individual assignment. You should do your own work. Any evidence of copying will result in a zero grade and additional penalties/actions 2. Submissions not handed on the due date and time will incur late penalty(i.e, 10 point deduction for each late hour) unless prior permission has been granted or there is a valid and verifiable excuse 3. Think carefully; formulate your answers, and then write them out concisely using English logic, mathematics and pseudocode (no programming language syntax) 4. Type your final answers in a Word document and submit online as a PDF through Canvas 5. Don't turn in handwritten answers with scribbling, cross-outs, erasures, etc. If an answer is unreadable, it will earn zero points. Neatly and cleanly handwritten submissions are also acceptable (1. 6pts) Computational problem solving: Estimating problem solving time Suppose that there are three algorithms to solve a problem: a O(n) algorithm (A1), a O(ilogni) algorithm (A2), and a O(2) algorithm (A3), where log is to the base 2. Using the techniques and assumptions presented in slide set L2-Butfet(SelectionProblem), determine how long in seconds it will take for each algorithm to solve a problem of size 200 million. You must show your work to get credit, i.e., a correct answer without showing how it is derived will receive zero credit. (2. 4pts) Computational problem solving: Problem specification Problem Definition: You are a member of a software engineering team, which is tasked to develop a mobile application for the SmartCity initiatives sponsored by an enterprise. The application is a transport sharing tool that will connect a driver with empty seats to people traveling to a specific target location. The driver's application will query a remote service to determine specific requests submitted by customers, where each request is defined by the position of the person making the ride sharing request. The location of a person is specified as pair (latitude, longitude). Given a list of requests as input and the computed shortest distances in terms of turn-by-turn directions between each pair of locations, the application generates the shortest possible route that visits each location exactly once (to pick up a customer) and return to the target location. Specify the problem to a level of detail that would allow you to develop solution strategies and corresponding algorithms. State the problem specification in terms of (1) inputs, (2) data representation, and (3) desired outputs. No need to discuss solution strategies