Christmas Ornaments $[$SETUP$]$

To decorate a typical Christmas tree, we use ornaments. And sometimes, we'd like to decorate even further, if the tree permits us$.$ Our condition to decorate further is that, once we use more ornaments, the tree should still have space for at least one more ornament.

A data set is provided as a string array, where each entry is denotes "tree$\_$id count info$\_$type". Values are separated by a single space.

$$ The tree$\_$id and count are made of of digits, that are at most $9$ digits long and start as non$-$zero digit.

$$ count represents the number of ornaments which could mean the number of existing ornaments on the tree, or the tree's max capacity of ornaments.

$$ info$\_$type will be either "used$\_$ornaments" or "max$\_$capacity". Hence For each tree, depending on info$\_$type you might get information about either number of ornaments used on this tree, or the max capacity of this very same tree.

Remember, we are looking to find out about the Christmas trees which won't permit us using more ornaments.

Given a data set with entries in no particular order, return an array of strings that denote tree$\_$ids of Christmas trees which has less space than newOrnamentsToAdd count. Return their ids in an array sorted increasingly.

Example

n $=7$

data $=["3099$ used$\_$ornaments", $"30105$ max$\_$capacity", $"12100$ used$\_$ornaments", $"2080$ used$\_$ornaments", $"12120$ max$\_$capacity", $"20101$ max$\_$capacity", $"21110$ used$\_$ornaments"$]$ roAdd$=20$

ID Used Max Cap. RemainingSpace

$30991056$

$1210012020$

$208010112$

$21110$

The trees with id's $30$ and $12$ cannot be decorated further for more than newOrnaments ToAdd $=20$ ornaments. In sorted numerical order, the return array is $["12","30"].$

Function Description

Complete the function processChristmas Trees in the editor below in java.

The function has the following parameter$($s$)$:

string data$[$n$]$: each data$[$i$]$ denotes the ith entry in the data

int newOrnaments ToAdd: the number of new ornaments we'd like to add.

Returns:

string: a string array of tree id's, sorted ascending by numeric value

Constraints:

$1<=$ n$,$ newOrnamentsToAdd $<=10^5$

$1<=$ newOrnamentsToAdds n

$$ Each tree$\_$id contains only characters in the range ascii$[\text{'}0\text{'}-\text{'}9\text{'}],$ is at most $9$ digits long and starts with a non$-$zero digit.

$$ Each count contains only characters in the range ascii$[\text{'}0\text{'}-\text{'}9\text{'}]$ and begins with a non$-$zero digit

$0<$ count $<=10$

$$ Each info$\_$type is either "used$\_$ornaments" or "max$\_$capacity".

$$ Each tree$\_$id's used$\_$ornaments count $<$ max$\_$capacity count

$$ Each tree has one decoration session.

$$ The result will contain at least one element.

class Result $\{$

$/*$

$*$ Complete the 'processChristmas Trees' function below.

$*$ The function is expected to return a STRING$\_$ARRAY.

$*$The function accepts following parameters:

$1.$ STRING$\_$ARRAY data

$2.$ INTEGER newOrnaments ToAdd$*/$

public static List processChristmas Trees $($List data, int newOrnamentsToAdd$)\{$

$\}$

$\}$