A parallel algorithm has a section that must be performed serially equal to 10%. Can one achieve a speedup of at least 15 times on a 64 core computer? True False What is NOT shared among the threads of a process? the code section the stack the data section the heap Suppose an application requires N threads that would each use the CPU continuously until finished. All threads have to do the same amount of work. The threads don't communicate with each other and no synchronization is needed. What threading model would guarantee the highest speedup on a computer with N CPUs? one-to-one two-level-model many-to-one many-to-many