What is wrong with my Java code?     public static void main(String[] args) {          class IncrementClass     {       T value;     }          IncrementClass i = new IncrementClass<>();             int[] intArray = new int[10];     for(i.value = 0; i.value

#include <stdio.h> struct Single {     int num; };   void printSingle(int f) {     int binaryNum[33];     int i = 0;     while(f>0)     {         binaryNum[i] = f % 2;         f = f/2;         i++;     }     for (int j=i-1; j>= 0; j--)     {         printf("%d",binaryNum[j]);     } }   int main() {     struct Single single;     single.num = 33;     printf("Number: %d\n",single.num);     printSingle(single.num);     return 0; }

For any element in keysList with a value greater than 50, print the corresponding value in itemsList, followed by a comma (no spaces). Ex: If the input is: 32 105 101 35 10 20 30 40 the output is: 20,30, 1 #include 2 3 int main(void) { const int SIZE_LIST = 4; int keysList[SIZE_LIST]; int itemsList[SIZE_LIST]; int i; 4 6 7 8 scanf("%d", &keysList[0]); scanf ("%d", &keysList[1]); scanf("%d", &keysList[2]); scanf("%d", &keysList[3]); 10 11 12 13 scanf ("%d", &itemsList[0]); scanf ("%d", &itemsList[1]); scanf("%d", &itemsList[2]); scanf ("%d", &itemsList[3]); 14 15 16 17 18 19 /* Your code goes here */ 20 21 printf("\n"); 22 23 return 0; 24 }

Course: Data Structure and Algorithims Language: Java Kindly make the program in 2 hours. Task is well explained.  You have to make the proogram properly in Java: Restriction: Prototype cannot be change you have to make program by using given prototype. TAsk: Create a class Node having two data members int data;     Node next;   Write the parametrized constructor of the class Node which contain one parameter int value assign this value to data and assign next to null Create class LinkList having one data members of type Node. Node head Write the following function in the LinkList class publicvoidinsertAtLast(int data);//this function add node at the end of the list publicvoid insertAthead(int data);//this function add node at the head of the list publicvoid deleteNode(int key);//this function find a node containing "key" and delete it publicvoid printLinkList();//this function print all the values in the Linklist public LinkListmergeList(LinkList l1,LinkList l2);// this function…