Write a function ``pretty`` that pretty prints a list. The function should return a string with the elements written with digits and separated by a single comma without spaces, and the string "[]" for the empty list. The ``list1`` above should print ``[]`` The ``list2`` above should print ``5`` The ``list3`` above should print ``3,1,4,1,5``

Describe a data structures that supports the stack push and pop operations and a third operation findmin, which returns the smallest element in the data structure, all in o(1) worst-case time.

Acommon algorithm for converting a decimal number to binary is to repeatedly divide the decimal number by 2 and save the remainder. this division is continued until the result is zero. then, each of the remainders that have been saved are used to construct the binary number.write a recursive java method that implements this algorithm.it will accept a value of int and return a string with the appropriate binary character representation of the decimal number.my code: public class lab16{public string converttobinary(int input){int a; if(input > 0){a = input % 2; return (converttobinary(input / 2) + "" +a); } return ""; } }

The word window is an example of a /an