Consider a list < vector >keys in which the first element of each vector in the list is a unique int key followed by the next elements being values for that key. Write a function in C++ to return the number of values a particular key stores. If the key does not contain any values, output 0.

int main()

{

list < vector >keys;

int size(int key)

{

//define function here

}

}