Based on the two instance variables (count and entry) in the contiguous implementation in 1a), can we implement a contiguous queue with the same level of time complexity (O(1)) for all of its methods, including its constructor, append, serve, retrieve and empty? Briefly explain your answer