Some explanation would be great thanks.

IMPORTANT: For this exercise, you will be defining a function which USES the Stack ADT. A stack implementation is provided to you as part of this exercise - you should not define your own Stack class. Instead, your code can make use of the Stack ADT methods: Stack(), push(), pop(), peek (), size() and is_empty(). Write a function named move_k_elements_to_bottom(a_stack, k) which takes a stack object and an integer k as parameters. The function shifts the top k elements to the bottom of the stack, where k is less than or equal to the number of elements in the stack and k is not negative. Note: you can assume that the parameter stack is not empty and you must not create any additional data structures other than stacks, e.g. you can not save the elements from the stack into a Python list. For example: Test Result Stack: [1, 2, 3, 4, 5] Stack: [3, 4, 5, 1, 2] s = Stack() for i in range(1, 6): s.push(i) print(s) move_k_elements_to_bottom(s, 3) print(s) Stack: [1, 2, 3, 4, 5] 5 - Stack() for i in range(1, 6): s.push(i) move_k_elements_to_bottom(s, 5) print(s) Stack: [1, 2, 3, 4, 5] s = Stack() for i in range(1, 6): s.push(i) move_k_elements_to_bottom(s, 0) print(s) Stack: [7, 8, 9, 10, 1, 2, 3, 4, 5, 6] s = Stack() for i in range(1, 11): s.push(i) move_k_elements_to_bottom(5, 4) print(s)