Write a pseudocode procedure called isprime that takes a integer n and returns true if n is a prime number and false otherwise. use the following algorithm: if n is less than 2 then return false. otherwise use a while loop to test n for divisibility by all integers from 2 up to the floor of the square root of n. within the loop, if n is divisible by i, return false. after the loop is done, return true. write pseudocode, as in the textbook. do not use c++ or any actual programming language.

1. you have a small business that is divided into 3 departments: accounting, sales, and administration. these departments have the following number of devices (computers, printers, etc.): accounting-31, sales-28, and administration-13. using a class c private network, subnet the network so that each department will have their own subnet. you must show/explain how you arrived at your conclusion and also show the following: all available device addresses for each department, the broadcast address for each department, and the network address for each department. also, determine how many "wasted" (not usable) addresses resulted from your subnetting (enumerate them).