Q1: Using Java, design an ADT for a two-color, double-stack ADT that consists of two stacks one red and one blue and has as its operations color-coded versions of the regular stack ADT operations. For example, this ADT should support both a redPush operation and a bluePush operation.

Do NOT implement. Describe the ADT and describe in detail how you would implement.

Q2: Describe a fast recursive algorithm for reversing a singly linked list L, so that the ordering of the nodes becomes opposite of what it was before.

Show pseudocode (or real code). Method should return new head reference.