For this problem, see the files QuickFindUF. javaPreview the document (in the book) and QuickFindUF2.java (A more efficient version). In QuickFindUF2 we keep a circular linked list of the items in each component. When union needs to join two distinct components, we traverse the smaller list, setting the id of each item to the id of the larger component. We don't traverse the larger list. 3(a). A QuickFindUF of size N uses 4N O(1) bytes of memory, where O(1) is constant time complexity. In tilde notation, we would say it uses ~4N bytes. Using tilde notation, how many bytes of memory are used by a QuickFindUF2 of size N