23:I[213999,["/_next/static/chunks/16a29cd6304f2411.js","/_next/static/chunks/1f26200cd6d05dff.js","/_next/static/chunks/c3f9d80d717636c8.js","/_next/static/chunks/bc1d040bf8e65c58.js","/_next/static/chunks/debb321617d7ca1e.js","/_next/static/chunks/f64101a76fad54b1.js","/_next/static/chunks/94fbb7fa806ad56b.js","/_next/static/chunks/db9978aba23a417e.js","/_next/static/chunks/14f8985e1634915f.js","/_next/static/chunks/aec63f7bf4bac799.js","/_next/static/chunks/2ed14a01cc7b5d05.js","/_next/static/chunks/e95f3e95128ec76b.js","/_next/static/chunks/7bba671d0b05dc6c.js","/_next/static/chunks/882a0401193a3b5d.js","/_next/static/chunks/abd3194e107ec3ca.js"],"AcademyWorkspaceWrapper"] 27:I[422650,["/_next/static/chunks/0306128cacc23787.js"],"IconMark"] 24:T54f,# Instructions Implement basic list operations. In functional languages list operations like `length`, `map`, and `reduce` are very common. Implement a series of basic list operations, without using existing functions. The precise number and names of the operations to be implemented will be track dependent to avoid conflicts with existing names, but the general operations you will implement include: - `append` (_given two lists, add all items in the second list to the end of the first list_); - `concatenate` (_given a series of lists, combine all items in all lists into one flattened list_); - `filter` (_given a predicate and a list, return the list of all items for which `predicate(item)` is True_); - `length` (_given a list, return the total number of items within it_); - `map` (_given a function and a list, return the list of the results of applying `function(item)` on all items_); - `foldl` (_given a function, a list, and initial accumulator, fold (reduce) each item into the accumulator from the left_); - `foldr` (_given a function, a list, and an initial accumulator, fold (reduce) each item into the accumulator from the right_); - `reverse` (_given a list, return a list with all the original items, but in reversed order_). Note, the ordering in which arguments are passed to the fold functions (`foldl`, `foldr`) is significant. 25:T430,class ListOps ## Do not use the functions map, concat, count, length, etc. ## and other built in ruby methods to solve these ## def self.arrays(arr) counter = 0 arr.each do counter += 1 end counter end def self.reverser(arr) answer = [] until arr.empty? answer << arr.pop end answer end def self.concatter(arr1, arr2) answer = [] arr1.each do |element| answer << element end arr2.each do |element| answer << element end answer end def self.mapper(arr) answer = [] arr.each do |element| answer << yield(element) if block_given? end answer end def self.filterer(arr) answer = [] arr.each do |element| answer << element if block_given? && yield(element) end answer end def self.sum_reducer(arr) total = 0 arr.each do |element| total += element end total end def self.factorial_reducer(arr) total = 1 arr.each do |element| total = total * element end total end end 26:T8f8,