Assume the following declaration of the list:

typedef struct _le{

char* str;

_le* next;

} node_list;

In every node of the list the string is stored (attribute str). Write a function that goes through the list, reads consecutive strings, encrypts them using the function from the previous task, and output the encrypted strings on the standard output. The function should take the head of the list as the parameter, and return a total number of letters encrypted.

There is no need for implementing the list, use it assuming that the list is implemented properly. There is no need for implementing the encryption function - just use the function from the previous task for encryption, or use the header only.