Apositive integer n is called prime if n > 1 and the only factors of n are 1 and n. it is known that a positive integer n > 1 is prime if n is not divisible by any prime integer m≤√n .the 1230th prime number is 10,007. let t be an integer such that 2 ≤ t ≤ 100,000,000. then t is prime if either t is equal to one of the first 1,230 prime numbers or t is not divisible by any of the first 1,230 prime numbers. write a program that declares an array of size 1,230 and stores the first 1,230 prime numbers in this array. the program then uses the first 1,230 prime numbers to determine if a number between 2 and 100,000,000 is prime. if a number is not prime, then output at least one of its prime factors.

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

Suppose a cpu with a write-through, write-allocate cache achieves a cpi of 2. what are the read and write bandwidths (measured by bytes per cycle) between ram and the cache? (assume each miss generates a request for one block.)

Avirus enters a computer or network as code embedded in other software directly from another computer