implement this function: chunk(array, size) ? Do not mutate the input array! ? Parameters array - Any JavaScript Array size - A positive integer Number indicating the desired "chunk" size. Return Value A new Array of Arrays. Each sub-Array has a length equal to size. Remaining elements are gathered into a final sub-Array. Do not use Array.prototype.slice in your implementation. Do not use Array.prototype.shift in your implementation. Do not use Array.prototype.pop in your implementation. Do not use Array.prototype.splice in your implementation. Examples chunk(['foo', 'bar', 'baz', 'qux'], 2); // -> [["foo", "bar"], ["baz", "qux"]] chunk([1, 2, 3, 4, 5], 1); // -> [[1], [2], [3], [4], [5]] chunk([false, true, false, true], 3); // -> [[false, true, false], [true]] chunk([], 7); // -> []

Write a Java program with a single-dimension array that holds 10 integer numbers and identify the maximum value of the 10 numbers. Next sort the array using a bubble sort and display the array before and after sorting.

Java programming help please. Main and other class of code is below. Thank you so so much.  i have to Write a program that does the following: You have an array of integers with positive and negative values. using one ourArray object (will post code of "ourArrary" below) , and in two loops maximum, How can you reorganize the content of the array so that all negative numbers are on one side and the positive numbers are on the other side. [-3, 2, -4, 5, -6, -8,-9, 7, 13] The output should be  [-3, -4, -6, -8, -9, 2, 5, 7, 13]    Our array code: public class ourArray<T> implements iQueue{ private T[] Ar; private int size = 0; private int increment = 100; //default constructor  @SuppressWarnings("unchecked") public ourArray () { Ar = (T[]) new Object[100]; size = 0; } //constructor that accepts the size  @SuppressWarnings("unchecked") public ourArray (int n) { Ar = (T[]) new Object[n]; size = 0; } //constructor that specifies the initial capacity and the increment…