Describe a linear time algorithm (i. e. O(n)) which finds the minimum Taxicab Geometry or rectilinear metric containing given n points in rectilinear plane. Hint: A rectilinear disk is a square (90 degrees rotated) You need to find a 90 deg rotated minimum square containing all points

The three logical operators used to write compound conditions are "and," "or," and "not." a: true b: false

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;

In cell h5 enter a formula that will calculate the percentage of attendees that went to the altamonte springs job fair in 2018.