solve it plzz fast fast

Write a deterministic search algorithm to search a given key element in the list. Calculate its time complexity. How will you decide the class (P, NP, or NP complete) of this problem? Draw a pictorial set representation of P,NP, or NP complete problems to justify your answer. How greedy strategy is useful to solve job sequencing algorithm? Is there any better algorithm to perform job sequencing algorithm? Consider the following list of jobs. Assume each job takes 1 unit of time for execution. List all the feasible solutions to satisfy the given constraint. What should be the sequence of jobs to earn the maximum profit? Let the messages for telegram are written in the post office and they have given some frequency counts i.e. how many times in a day a message is transmitted. Messages have given some codes consisting of symbols {0,1} and according to the length of code, the customer is charged. Instead of transmitting the messages, only the codes are transmitted. Design the codes for the following to minimize the total no of bits transmitted