Give aymptotic upper and lower bounds for t(n)in each ofthe following recurrences. assume that t(n) is constant forsufficiently small n. make your bounds as tight as possible, andjustify your answers.
1) t(n)= 5t(n/5)+n/log n

You are working as a security analyst in a company xyz that owns the whole subnet range of 23.0.0.0/8 and 192.168.0.0/8. while monitoring the data, you find a high number of outbound connections. you see that ip's owned by xyz (internal) and private ip's are communicating to a single public ip. therefore, the internal ip's are sending data to the public ip. after further analysis, you find out that this public ip is a blacklisted ip, and the internal communicating devices are compromised. what kind of attack does the above scenario depict?

State 7 common key's for every keyboard

Write a fragment of code that reads in strings from standard input, until end-of-file and prints to standard output the largest value. you may assume there is at least one value. (cascading/streaming logic, basic string processing)