2. The table below shows some experimental running times for four algorithms, expressed as a function of the input size N. N Algorithm A Algorithm B Algorithm Algorithm D 2 6 10 4 4 4 12 20 16 16 8 24 30 64 256 16 48 40 256 65536 32 64 128 256 96 192 384 768 50 60 70 80 1024 4096 16384 65536 4.29E+09 1.84E+19 3.4E+38 1.16E+77 Using Big-Oh notation, state the computational complexity of each algorithm. Explain your reasoning 120%)