Assume you have two algorithms, a and b, both of which perform the same function, although their implementations differ. assume that algorithm a has a running time of o(n3 + 2n2+6n +10) and algorithm b has a running time of o(6n2 + 3n +10 ). also assume that the value of n is restricted to the set of natural numbers i. e., {1, 2, 3, }. answer the follow­ing questions:

for what values of n algorithm a is more efficient than algorithm b?

for what values of n algorithm b is more efficient than algorithm a?

for what values of n might both algorithms be expected to operate with the same efficiency?

This program reads a file called 'test.txt'. you are required to write two functions that build a wordlist out of all of the words found in the file and print all of the unique words found in the file. remove punctuations using 'string.punctuation' and 'strip()' before adding words to the wordlist. write a function build_wordlist() that takes a 'file pointer' as an argument and reads the contents, builds the wordlist after removing punctuations, and then returns the wordlist. another function find_unique() will take this wordlist as a parameter and return another wordlist comprising of all unique words found in the wordlist. example: contents of 'test.txt': test file another line in the test file output: ['another', 'file', 'in', 'line', 'test', 'the']

Which of the choices sean are not true when considering virus behavior

What engine component is shown in the above figure?