import java.util.ArrayList;
import java.util.Arrays;
public class PS
{
/**
* Write the method named mesh.
*
* Start with two ArrayLists of String, A and B, each with
* its elements in alphabetical order and without any duplicates.
* Return a new list containing the first N elements from the two
* lists. The result list should be in alphabetical order and without
* duplicates. A and B will both have a size which is N or more.
* Your solution should make a single pass over A and B, taking
* advantage of the fact that they are in alphabetical order,
* copying elements directly to the new list.
*
* Remember, to see if one String is "greater than" or "less than"
* another, you need to use the compareTo() method, not the < or="">
* operators.
*
* Examples:
* mesh(["a","c","z"], ["b","f","z"], 3) returns ["a","b","c"]
* mesh(["a","c","z"], ["c","f","z"], 3) returns ["a","c","f"]
* mesh(["f","g","z"], ["c","f","g"], 3) returns ["c","f","g"]
*
* @param a an ArrayList of String in alphabetical order.
* @param b an ArrayList of String in alphabetical order.
* @param n the size of the resulting list to return.
* @return a list of n elements in alphabetical order.
*/
// TODO - Write the mesh method here.