Algorithm problem 6 [Problem3-3]
a. Rank the following functions by order of growth; that is,find an arrangement g1,g2,...,g30 of the functions satisfying g1 ∈ Ω(g2),g2 ∈ Ω(g3),...,g29 ∈ Ω(g30). Partition your list into equivalence classes such that ƒ(n) and g(n) are in the same class if and only if ƒ(n)∈Θ(g(n)).
- lg(lg∗ n) - 2^(lg∗ n) -( sqrt(2))^(lg n) - n^2 - n! - (lg n)! - (3/2)^n - n^3 - lg^(2)*n - lg(n!) - 2^2^n - n^(1/ lg n) - ln ln n - lg∗ n - n*2^n - n ^(lg lg n) - ln n - 1 - 2^(lg n) - (lg n)^(lg n) - e^n - n - 4^(lg n) - (n+ 1)! - (sqrt(lg n)) - lg ∗(lg n) - 2(sqrt(2 lg n)) - n - 2n - n lg n - 2^((2)^(n+1))
b. Give an example of a single nonnegative function ƒ(n) such that for all functions g(n) in part (a), ƒ(n) is neither in O(g(sub(i))(n)) nor in Ω(g(n)).

Now, open this passage to read about fafsa requirements. describe the information you will need to provide in order to complete a fafsa. list at least three of the required documents you must include.

Your friend kayla is starting her own business and asks you whether she should set it up as a p2p network or as a client-server network. list three questions you might ask to kayla decide which network to use and how her answers to those questions would affect your recommendation.

This question involves a class named textfile that represents a text file. public class textfile { private string filename; private string filename; private arraylist words; // constructors not shown // postcondition: returns the number of bytes in this file public int filesize() { } // precondition: 0 < = index < words.size() // postcondition: removes numwords words from the words arraylist beginning at // index. public void deletewords(int index, int numwords) { } // precondition: 0 < = index < = words.size() // postcondition: adds elements from newwords array to words arraylist beginning // at index. pub lic voidaddwords(int index, string[] newwords) { } // other methods not shown } complete the filesize() method. the filesize() is computed in bytes. in a text file, each character in each word counts as one byte. in addition, there is a space in between each word in the words arraylist, and each of those spaces also counts as one byte. for example, suppose the words arraylist stores the following words: { mary had a little lamb; its fleece was white as snow. } the filesize() method would compute 4 + 3 + 1 + 6 + 5 + 4 + 6 + 3 + 5 + 2 + 5 as the sum of the lengths of each string in the arraylist. the value returned would be this sum plus 10, because there would also be 10 spaces in between the 11 words. complete the filesize() method below: // postcondition: returns the number of bytes in this file public int filesize() { }