Consider the grammar with start symbol S and terminals a, b, with the rules: S → aSb | SS | ε . Choose all the correct statements about an arbitrary string in the language generated by this grammar.
The options refer to the following definitions:
A prefix of a string σ is any string α for which there is a string β such that σ=αβ. Similarly, a suffix of a string σ is any string β for which there is a string α such that σ=αβ. For instance, for a string σ=xyxyz, xyx is a prefix and xyz is a suffix (but not vice versa).
Choose one or more:
a. In any suffix of the string, number of a's ≤ number of b's
b. If the string is split into two equal parts, in each part, number of a's = number of b's
c. number of a's = number of b's
d. In any prefix of the string, number of a's ≥ number of b's
e. The string starts with an a
f. In any prefix of the string, number of a's = number of b's

Consider the following declarations (1, 2, 3, 5, 7)class bagtype{public: void set(string, double, double, double, double); void print() const; string getstyle() const; double getprice() const; void get(double, double, double, double); bagtype(); bagtype(string, double, double, double, double); private: string style: double l; double w; double h; double price; }; a.) write the definition of the number function set so that private members are set according to the parametersb.) write the definition of the member function print that prints the values of the data membersc.) write the definition of the default constructor of the class bagtype so that the private member variables are initialized to "", 0.0, 0.0, 0.0, 0.0, respectively d.) write a c++ statement that prints the value of the object newbag.e.) write a c++ statement that declares the object tempbag of type bagtype, and initialize the member variables of tempbag to "backpack", 15, 8, 20 and 49.99, respectively

Least square fit to polynomial write a function leastsquarefit3pol that solves a linear system of equations to find a least squares fit of a third order polynomial to an experimental data set given as two row arrays. the function leastsquarefit3pol must explicitly solve a set of linear equations and cannot use polyfit. there should be no restriction on the size of the problem that can be solved.

Write the command that can be used to answer the following questions. (hint: try each out on the system to check your results.) a. find all files on the system that have the word test" as part of their filename. b. search the path variable for the pathname to the awk command. c. find all files in the /usr directory and subdirectories that are larger than 50 kilobytes in size. d. find all files in the /usr directory and subdirectories that are less than 70 kilobytes in size. e. find all files in the / directory and subdirectories that are symbolic links. f. find all files in the /var directory and subdirectories that were accessed less than 60 minutes ago. g. find all files in the /var directory and subdirectories that were accessed less than six days ago. h. find all files in the /home directory and subdirectories that are empty. i. find all files in the /etc directory and subdirectories that are owned by the group bin."