Code runs on my computer: EXPERIMENT: Medium Array (n=100), Reverse Values BUBBLE SORT: 687963 nanoseconds SELECTION SORT: 100837 nanoseconds INSERTION SORT: 90904 nanoseconds EXPERIMENT: Medium Array (n=100), Reverse Values BUBBLE SORT: 3088 nanoseconds SELECTION SORT: 113612 nanoseconds INSERTION SORT: 5844 nanoseconds EXPERIMENT: Medium Array (n=100), Reverse Values BUBBLE SORT: 321418 nanoseconds SELECTION SORT: 83828 nanoseconds INSERTION SORT: 132199 nanoseconds EXPERIMENT: Medium Array (n=1000), Reverse Values BUBBLE SORT: 9828306 nanoseconds SELECTION SORT: 4099933 nanoseconds INSERTION SORT: 10467838 nanoseconds EXPERIMENT: Medium Array (n=1000), Reverse Values BUBBLE SORT: 6448 nanoseconds SELECTION SORT: 790242 nanoseconds INSERTION SORT: 62423 nanoseconds EXPERIMENT: Medium Array (n=1000), Reverse Values BUBBLE SORT: 4117563 nanoseconds SELECTION SORT: 819195 nanoseconds INSERTION SORT: 12197551 nanoseconds EXPERIMENT: Medium Array (n=10000), Reverse Values BUBBLE SORT: 147756461 nanoseconds SELECTION SORT: 41967463 nanoseconds INSERTION SORT: 15434499 nanoseconds EXPERIMENT: Medium Array (n=10000), Reverse Values BUBBLE SORT: 10130 nanoseconds SELECTION SORT: 42177964 nanoseconds INSERTION SORT: 28683 nanoseconds EXPERIMENT: Medium Array (n=10000), Reverse Values BUBBLE SORT: 123152533 nanoseconds SELECTION SORT: 43971491 nanoseconds INSERTION SORT: 31034670 nanoseconds

At the indicated place in the code, add the necessary lines to time all three sorting algorithms independently when an experiment is run. For example, wed like to something like what is shown below when an experiment runs.

EXPERIMENT: Tiny Array (n=100), Random Values BUBBLE SORT: 6323704 nanoseconds SELECTION SORT: 125413 nanoseconds INSERTION SORT: 122845 nanoseconds

At the indicated place in the code, add the necessary lines to conduct experiments to complete the data table on the back side of this sheet?