his question has three parts and tests mathematical induction. Give a recursive definition of the set P of all positive integers greater than 3, formulate the appropriate induction principle, and then use mathematical induction to prove that (i) (i) 2< k! for all positive integers n > 3. + Question 3 Acuivate Windows Construct a regular expression that defines the language of all words that do NOT end and begin with the same letter. The two shortest words in the language are ab and ba. ito activate Windows.

3. bob is arguing that if you use output feedback (ofb) mode twice in a row to encrypt a long message, m, using the same key each time, it will be more secure. explain why bob is wrong, no matter what encryption algorithm he is using for block encryption (15 points).

Which of the following has not been attributed at least in part to social media a. drug addiction b. depression c. kidnapping d. murder

Consider the following statements: struct nametype{string first; string last; }; struct coursetype{string name; int callnum; int credits; char grade; }; struct studenttype{nametype name; double gpa; coursetype course; }; studenttype student; studenttype classlist[100]; coursetype course; nametype name; mark the following statements as valid or invalid. if a statement is invalid, explain why.a.) student.course.callnum = "csc230"; b.) cin > > student.name; c.) classlist[0] = name; d.) classlist[1].gpa = 3.45; e.) name = classlist[15].name; f.) student.name = name; g.) cout < < classlist[10] < < endl; h.) for (int j = 0; j < 100; j++)classlist[j].name = name; i.) classlist.course.credits = 3; j.) course = studenttype.course;