Alice has three array-based stacks, A, B, and C, such that A has capacity 0, B has capacity 7, and C has capacity 0. Initially, B is full, and A and C are empty. Unfortunately, the person who programmed the class for these stacks made the push and pop functions private. The only function Alice can use is a static function, transfer(S,T), which transfers elements from stack S to stack T until either S becomes empty or T becomes full. So, for example, starting from our initial configuration and performing transfer(B,C) results in A = 0, B = 3, C = 4. Describe a sequence of transfer operations that starts from the initial configuration and results in B holding 4 elements at the end in four steps with transfer(B, A) first. Initial configuration is A = 0, B = 7, C = 0