II)The following parallel code determines the number of primes between o and N: Assume Global Sum is a shared variable; Assume that loskward is a semaphore and Process.Sum is a shared array: Consider the following solutions and indicate if the solution is correct. Indicate the pitfalls if any exist with each one of the solutions. *Global Sum 0: spin lock(lockward): spin unlock(lockvard):3 processioin(uprocsid): II)The following parallel code determines the number of primes between o and N: Assume Global Sum is a shared variable; Assume that loskward is a semaphore and Process.Sum is a shared array: Consider the following solutions and indicate if the solution is correct. Indicate the pitfalls if any exist with each one of the solutions. *Global Sum 0: spin lock(lockward): spin unlock(lockvard):3 processioin(uprocsid)