Question: Please also write a report that uses the program as a research tool Theory 1. Assume you are given two linear lists of size n
Please also write a report that uses the program as a research tool

Theory 1. Assume you are given two linear lists of size n each; consider the problem of determining whether any element of one list is an element of the other (not value, element! !). (a) Derive a lower bound for this problem. (b) Design an algorithm for this problem. Derive its time complexity. It should be as close to your lower bound as possible
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
