Write this function given the template below for linked lists in C++ with the given requirements: O(n) Complexity

Given implementation of Linked list that can be helpful for writing function:

*TODO * function: suffix maxes * desc: constructs a new list of the same length as the calling object with the value stored at position i of the new list is the MAXIMUM value in the suffix (or tail) of the calling list starting from position i. This new list is returned and the calling list is unchanged. Example: Given List: [6, -18, 12, 4, 1, 7, 2, 5 4] New list: [12, 12, 12, 7, 7, 7, 5, 5, 4] (as a sub-example, the marked entry in the new list (marked with ' is the max of the marked suffix in the given 1ist (marked with a bunch of s) REQUIREMENTS: Total Runtime: O(n) Calling list is unchanged. ListT> suffix maxes() const return nullptr