1) Given a chessboard size, a knight's starting position, an end position, and a bishop's position, find the minimum number of moves required for the knight to reach the end position. The knight cannot move to any square that the bishop is attacking, unless it captures the bishop on that square. 2) Implement a stack with the following functions: pop, push, inc, isEmpty, and peek. The inc function should increase the first n elements of the stack by a value i.