1. Find Pascal’s triangle. 2. Create 125 random numbers and store them in a 3D [5x5x5] array. Search for an element in this array. 3. Develop a method squeeze() that will take an array of integers and...

1. Find Pascal’s triangle.

2. Create 125 random numbers and store them in a 3D [5x5x5] array. Search for an element in this array.

3. Develop a method squeeze() that will take an array of integers and returns an array without duplicates.

4. Develop a method to plot Neckar cube.