(6 points) Suppose that we have a generic MyArraySet class that represents a set of un-ordered,
distinct T elements. public class MyArraySet < T > { private T [ ] data; // Given private int num;
// Given private int find( T findObj) { / Assume a correct implementation / } // ... Give an
implementation of a public method called remove that takes as its only parameter a T obj to be
deleted from the list, if it exists. Give the most efficient implementation you can think of and do
not add any additional methods or instance variables..
(6 points) Suppose that we have a generic MyArraySet class that repres.pdf
1. (6 points) Suppose that we have a generic MyArraySet class that represents a set of un-ordered,
distinct T elements. public class MyArraySet < T > { private T [ ] data; // Given private int num;
// Given private int find( T findObj) { / Assume a correct implementation / } // ... Give an
implementation of a public method called remove that takes as its only parameter a T obj to be
deleted from the list, if it exists. Give the most efficient implementation you can think of and do
not add any additional methods or instance variables.
![(6 points) Suppose that we have a generic MyArraySet class that represents a set of un-ordered,
distinct T elements. public class MyArraySet < T > { private T [ ] data; // Given private int num;
// Given private int find( T findObj) { / Assume a correct implementation / } // ... Give an
implementation of a public method called remove that takes as its only parameter a T obj to be
deleted from the list, if it exists. Give the most efficient implementation you can think of and do
not add any additional methods or instance variables.](https://image.slidesharecdn.com/6pointssupposethatwehaveagenericmyarraysetclassthatrepres-230316082537-7340fe01/85/6-points-Suppose-that-we-have-a-generic-MyArraySet-class-that-repres-pdf-1-320.jpg)
