Data structure The answer question 1 [1] Write a Java method that takes two 2-dimensional integer arrays and adds them component wise. [2] Describe an algorithm for concatenation two singly linked...

i need the answer quickly

Extracted text: Data structure The answer question 1 [1] Write a Java method that takes two 2-dimensional integer arrays and adds them component wise. [2] Describe an algorithm for concatenation two singly linked lists Land M, into a single list L' that contains all the nodes of L followed by all the nodes of M. [3] Describe a method for finding the middle node of a doubly linked list with header and trailer sentinels by "link hopping" and without relying on explicit knowledge of the size of the list. In the case of an even number of nodes, report the node slightly left of the center as the "middle." What is the running time of this method?