consider a simple block allocation of n data items to p processes in which the first p - 1 processes get ceil(n/p) items each and the last process gets what is left over. a) find values for n and p where the last process does not get any elements. b) find values for n and p where floor(p/2) processes do not get any values. assume p>1.