Compile and run the program without any extra optimizations, but with profiling for timing:

gcc $-$c $-$pg $-$O$0$ main.c

gcc $-$c $-$pg $-$O$0$ tree.c

gcc $-$c $-$pg $-$O$0$ list.c

gcc main.o tree.o list.o $-$pg $-$O$0-$o assign$1-0$

Run the program twice timing it both times, and answer the following:

How for $500,000$ numbers how many self seconds did generateList$()$ take?

How for $500,000$ numbers how many self seconds did generateTree$()$ take?