Problem Statement

String selection Given N strings. Each string is given in the form of an array cnt of size 26, where i th element in array denotes the count of i th character of lowercase English alphabets in the string. You have to select exactly 4 strings and insert the strings into Trie . You are allowed to shuffle the characters in each string. Find the minimum number of nodes present in Trie if the strings are selected optimally. Notes Trie will always have a root node. Include the root node in the count of nodes present in Trie. Insertion proceeds by walking the Trie according to the string to be inserted, then appending new nodes for the suffix of the string that is not contained in the Trie. Function description Complete the solve function. This function takes the following 2 parameters and returns the required answer. Parameters: N: Represents the number of strings cnt: Represents a 2D array representing the count of each lowercase English alphabet in the string. It has dimension N*26. Input