Please answer A and B. Thank you.

(a) (10 points) Instead of single link list, if a double link list is used, what is the optimal number of skip nodes (express stations) for N original nodes (local stations)? Justify your conclusion with mathematical derivations 4. b) (10 points) Given an unsorted integer array A of size n, develop an algorithm with time complexity as low as possible to find two indexes i andj such that A+AU] 100, i and j may or may not the same value. Describe your algorithm ideas and time complexity with justifications. (a) (10 points) Instead of single link list, if a double link list is used, what is the optimal number of skip nodes (express stations) for N original nodes (local stations)? Justify your conclusion with mathematical derivations 4. b) (10 points) Given an unsorted integer array A of size n, develop an algorithm with time complexity as low as possible to find two indexes i andj such that A+AU] 100, i and j may or may not the same value. Describe your algorithm ideas and time complexity with justifications