Universitydriver class the universitydriver contains the main method. your program must run according to the sample run examples provided below. the following commands can be entered: (a) "hire" //to hire a new faculty member (b) "admit" //to admit a new student (c) "find student" //to display information about a specific student: name, date of birth, and major (d)"find faculty" //display information about a specific faculty: name, date of birth, and courses; (e) "list students" // list the first and last names of all students (f) "list faculty" // list the first and last names of all faculty (g)"quit"// terminates the program and saves all person data in a "universitypersons. per" file, including the ones hired and admitted by the user

Write a program called assignment3 (saved in a file assignment3.java) that computes the greatest common divisor of two given integers. one of the oldest numerical algorithms was described by the greek mathematician, euclid, in 300 b.c. it is a simple but very e↵ective algorithm that computes the greatest common divisor of two given integers. for instance, given integers 24 and 18, the greatest common divisor is 6, because 6 is the largest integer that divides evenly into both 24 and 18. we will denote the greatest common divisor of x and y as gcd(x, y). the algorithm is based on the clever idea that the gcd(x, y) = gcd(x ! y, y) if x > = y and gcd(x, y) = gcd(x, y ! x) if x < y. the algorithm consists of a series of steps (loop iterations) where the “larger” integer is replaced by the di↵erence of the larger and smaller integer. this continues until the two values are equal. that is then the gcd.

The basic work area of the computer is it screen that you when you first fire up your computer

How to do this programming flowchart?