Computer science student reads on stack overflow that software algorithms  can be made faster by parallelizing their execution - this makes sense, why count to a billion when you can count to 100 million 10 times and add up the results.  student downloads and installs the recommended  parallel execution library for the language being used, but notices that the program either slows down or runs at the same speed when using the library in different runs.   which of the following could explain the student's findings pick the correct choices programming language of choice does not actually support native parallel execution despite availability of library. the chosen algorithm simply cannot be executed in a parallel fashion, a property of the algorithm. the overhead of parallelism outweighs the benefits of adding parallelism leading to net slow down in algorithm execution the system running the algorithm does not have appropriate resources to execute the algorithm faster in a parallel fashion than it does in a serial fashion. the memory ordering properties of the system caused the calculation to be repeated multiple times instead of just once, with the most accurate answer being selected.