Given a vector of values each of which is larger than zero, for each value, find the closest element that comes before it and is larger than it. For example, consider the following input vector.

10	5	9	70	200	50	70	300	75	120	180	130	95	310	360	72	78	400	30	22
0	1	2	3	4	5	6	7	8	9	10	11	12	13	14	15	16	17	18	19

For this input vector, your function should produce the following output vector.

0	10	10	0	0	200	200	0	300	300	300	180	130	0	0	360	360	0	400	30
0	1	2	3	4	5	6	7	8	9	10	11	12	13	14	15	16	17	18	19

I need help with this assignment both iteratively and recursively. (Two separate main files for each version).

void largest_left_iterative(const std::vector &numbers, std::vector &result); // iterative prototype

void largest_left_recursive(const std::vector &numbers, std::vector &result, int n); // Recursive prototype