For function "decibinary", write the missing parts of the recursion case. This function should return a string that stores the binary equivalent for decimal int variable "num". Example: the binary equivalent of 13 may be found by repeatedly dividing 13 by 2. So, 13 in base 2 is represented by the string "1101".
String decibinary (int num) { if (num < 2) return Integer.toString(num); else return <<Missing a Recursive call>> + <<Missing command>>; }