Please help with questions A and B. Thank you.

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