please finish question b

1a An encryption routine, using Algorithm X, has a running time of Tx(N) 100VN + 4 for an input containing N characters. i) Using the formal definition of O(f(N), show that Tx (N) O(2N). ii) You are implementing an application to encrypt social media messages. Each message has a maximum of 144 characters. If the running time using Algorithm Y is TY(N) 2N, for a message with N characters, would you build your application using Algorithm X or Algorithm Y, and why b Sort the following table of student data by degree, according to the ordering a5