Given a string, compute recursively $($no loops$)$ the number of lowercase $\text{'}x\text{'}$ chars in the string. Examples:

countX$(hi)4$

countX$(xhixhix)3$

countX$(hi)0$

public int count X$($String str$)\{$