Part A- Derive a formula for the density, d, of a doubly linked list as a function of n (the number of nodes in the structure) and w (the width of the client's clones). Show your work.

Part B- When n becomes very large, the formula for density derived in Part A becomes simpler. Give the simplified version of the formula for large values of n.

Part C- Use the simplified formula derived in Part B to calculate the node width, w, for a density of 0.8. (show your work).

It appears Density here is defined as:

D = info bytes / (info bytes + overhead bytes)