You are given an array of strings of different lengths, but the total number of characters over all the strings is n. Describe an algorithm to sort the strings in alphabetic order (eg. algorithm < cs < fiu) in O(n) time

Which of the following statements is incorrect in relation to processes: while, strictly speaking, at any instant of time, the cpu is running only one process, in the course of 1 second, it may work on several of them, giving the illusion of parallelism a process is just an instance of an executing program, including the current values of the program counter, registers, and variables processes can be created when an operating system is booted, created by the user, or a running process can create children processes there is a master process, which when started can last forever, and is not killable