Suppose you have the algorithms with the three running times listed below. a- What will be the running costs after doubling the input size? 1) 2n 2) log(n) 3) 2n b- Draw graphs for each algorithm (one the same XY coordinate). c- Which algorithm has the highest time complexity?